On the zero-free polynomial approximation problem

DOI10.1016/J.JAT.2015.10.003zbMATH Open1342.41007arXiv1501.00247OpenAlexW2137573198MaRDI QIDQ259092FDOQ259092

A. A. Danielyan

Publication date: 10 March 2016

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Abstract: Let $E$ be a compact set in $mathbbC$ with connected complement, and let $A(E)$ be the class of all complex continuous function on $E$ that are analytic in the interior $E^0$ of $E$. Let $finA(E)$ be zero free on $E^0$. By Mergelyan's theorem $f$ can be uniformly approximated on $E$ by polynomials, but is it possible to realize such approximation by polynomials that are zero-free on $E$? This natural question has been proposed by J. Andersson and P. Gauthier. So far it has been settled for some particular sets $E$. The present paper describes classes of functions for which zero free approximation is possible on an arbitrary $E$.

Full work available at URL: https://arxiv.org/abs/1501.00247

zbMATH Keywords

complex-valued analytic functionspolynomial approximation

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Capacity and harmonic measure in the complex plane (30C85) Approximation in the complex plane (30E10) Potentials and capacity, harmonic measure, extremal length and related notions in two dimensions (31A15) Approximation with constraints (41A29)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Mergelyan's approximation theorem with nonvanishing polynomials and universality of zeta-functions
• Mergelyan's theorem for zero free functions
• Approximating functions by the Riemann zeta-function and by polynomials with zero constraints
• Zero-free polynomial approximation on a chain of Jordan domains
• Mergelyan’s theorem with polynomials non-vanishing on unions of sets
• Mergelyan's Theorem on Uniform Polynomial Approximation.
• Approximation of and by the Riemann zeta-function

Cited In (6)

• FREE APPROXIMATIONS
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• 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
• Title not available (Why is that?)

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)