Related papers: Computing the Zeros of a Holomorphic Function Usin…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit disk. Low rank approximations to functions in polar geometries are formed by synthesizing the disk analogue of the double Fourier…
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…
We propose polynomial-time algorithms for finding nontrivial zeros of quadratic forms with four variables over rational function fields of characteristic 2. We apply these results to find prescribed quadratic subfields of quaternion…
The known Complex Step Derivative (CSD) method allows easy and accurate differentiation up to machine precision of real analytic functions by evaluating them a small imaginary step next to the real number line. The current paper proposes…
This manuscript presents a novel and reliable third-order iterative procedure for computing the zeros of solutions to second-order ordinary differential equations. By approximating the solution of the related Riccati differential equation…
The real and complex zeros of the parabolic cylinder function $U(a,z)$ are studied. Asymptotic expansions for the zeros are derived, involving the zeros of Airy functions, and these are valid for $a$ positive or negative and large in…
Using results from theory of operators on a Hilbert space, we prove approximation results for matrix-valued holomorphic functions on the unit disc and the unit bidisc. The essential tools are the theory of unitary dilation of a contraction…
Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…
Fourier analysis on the Boolean hypercube is fundamentally defined as the orthogonal decomposition of the space of pseudo-Boolean functions with respect to the uniform probability measure. In this work, we propose an ANOVA-based…
Approximations based on rational functions are widely used in various applications across computational science and engineering. For univariate functions, the adaptive Antoulas-Anderson algorithm (AAA), which uses the barycentric form of a…
In this paper, we study and analyze zeroth-order stochastic approximation algorithms for solving bilvel problems, when neither the upper/lower objective values, nor their unbiased gradient estimates are available. In particular, exploiting…
In this paper we study the convergence of an iterative algorithm for finding zeros with constraints for not necessarily monotone set-valued operators in a reflexive Banach space. This algorithm, which we call the proximal-projection method…
A flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It…
The Fueter mapping theorem gives a constructive way to extend holomorphic functions of one complex variable to monogenic functions, i.e., null solutions of the generalized Cauchy-Riemann operator in $\mathbb{R}^4$, denoted by $\mathcal{D}$.…
Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
We consider the problem of minimizing a high-dimensional objective function, which may include a regularization term, using (possibly noisy) evaluations of the function. Such optimization is also called derivative-free, zeroth-order, or…
We show that a nonvanishing analytic function on a domain in the unit disc can be approximated by (a scalar multiple of) a Blaschke product whose zeros lie on a prescribed circle enclosing the domain. We also give a new proof of the…
It is known that the Cauchy's argument principle, applied to an holomorphic function $f$, requires that $f$ has no zeros on the curve of integration. In this short note, we give a generalization of such a principle which covers the case…
Rational approximation appears in many contexts throughout science and engineering, playing a central role in linear systems theory, special function approximation, and many others. There are many existing methods for solving the rational…