On the zero-free polynomial approximation problem
From MaRDI portal
Abstract: Let be a compact set in with connected complement, and let be the class of all complex continuous function on that are analytic in the interior of . Let be zero free on . By Mergelyan's theorem can be uniformly approximated on by polynomials, but is it possible to realize such approximation by polynomials that are zero-free on ? This natural question has been proposed by J. Andersson and P. Gauthier. So far it has been settled for some particular sets . The present paper describes classes of functions for which zero free approximation is possible on an arbitrary .
Recommendations
- 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
Cites work
- 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?)
- Approximating functions by the Riemann zeta-function and by polynomials with zero constraints
- Approximation of and by the Riemann zeta-function
- Mergelyan's Theorem on Uniform Polynomial Approximation.
- Mergelyan's approximation theorem with nonvanishing polynomials and universality of zeta-functions
- Mergelyan's theorem for zero free functions
- 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
Cited in
(10)- Zero-free polynomial approximation on the union of two sets amply intersecting
- Zero-free polynomial approximation on a chain of Jordan domains
- Mergelyan's theorem for zero free functions
- FREE APPROXIMATIONS
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- scientific article; zbMATH DE number 4107351 (Why is no real title available?)
- Uniform approximation in the spherical distance by functions meromorphic on Riemann surfaces
- On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
- Simultaneous zero-free approximation and universal optimal polynomial approximants
- scientific article; zbMATH DE number 6861917 (Why is no real title available?)
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)