On the zero-free polynomial approximation problem
Let \(E\) be a compact set of \(\mathbb{C}\). Denote by \(A(E)\) the algebra of complex-valued continuous functions on \(E\) which are analytic in the interior of \(E\). In the general case, the possibility of uniform polynomial approximation of functions from the space \(A(E)\) is given by the theorem of S. N. Mergelyan. The special problem of uniform polynomial approximation of a function \(f\in A(E)\) by polynomials which have not zeros in \(E\) was proposed by J. Andersson and P. Gauthier and became the subject of several papers from the last years. It implies a double discussion about the conditions on the domain \(E\) and the properties of the function \(f\in A(E)\). In this direction, in this paper, two results are given which, in the case where \(E\) has a connected complement, assure that certain functions \(f\in A(E)\) allow free-zero uniform polynomial approximation.
- Mergelyan's theorem for zero free functions
- Zero-free polynomial approximation on a chain of Jordan domains
- Zero-free polynomial approximation on the union of two sets amply intersecting
- scientific article; zbMATH DE number 4142414
- Polynomial approximation on compact sets of zero logarithmic capacity and analyticity of functions
- Approximating functions by the Riemann zeta-function and by polynomials with zero constraints
- Approximation of and by the Riemann zeta-function
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 3283536 (Why is no real title available?)
- scientific article; zbMATH DE number 3077920 (Why is no real title available?)
- Mergelyan's approximation theorem with nonvanishing polynomials and universality of zeta-functions
- Mergelyan's theorem for zero free functions
- Mergelyan's Theorem on Uniform Polynomial Approximation.
- Mergelyan’s theorem with polynomials non-vanishing on unions of sets
- The peak-interpolation theorem of Bishop
- Zero-free polynomial approximation on a chain of Jordan domains
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Simultaneous zero-free approximation and universal optimal polynomial approximants
- Uniform approximation in the spherical distance by functions meromorphic on Riemann surfaces
- FREE APPROXIMATIONS
- scientific article; zbMATH DE number 4107351 (Why is no real title available?)
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- Mergelyan's theorem for zero free functions
- scientific article; zbMATH DE number 6861917 (Why is no real title available?)
- Zero-free polynomial approximation on a chain of Jordan domains
- Zero-free polynomial approximation on the union of two sets amply intersecting
This page was built for publication: On the zero-free polynomial approximation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259092)
