Approximation on \([0,\infty)\) by reciprocals of polynomials with nonnegative coefficients

DOI10.1016/0021-9045(84)90133-3zbMath0532.41029OpenAlexW2072853426MaRDI QIDQ788937

G. D. (Jerry) Taylor, Edwin H. jun. Kaufman, David J. Leeming

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0021-9045(84)90133-3

zbMATH Keywords

discretizationuniquenesscharacterizationExistencebest uniform approximationreciprocals of polynomials

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20) Approximation with constraints (41A29)

Cites Work

• Unnamed Item
• Unnamed Item
• Strong uniqueness for Chebyshev approximation by reciprocals of polynomials on \([0,\infty)\)
• A characterization of entire functions \(\sum^\infty_{k=0} a_kz^k\) with all \(a_k\geq 0\)
• An adaptive differential correction algorithm
• Uniform rational approximation by differential correction and remes‐differential correlation
• Uniform rational approximation on large data sets
• Existence Questions for the Problem of Chebyshev Approximation by Interpolating Rationals
• The Remez Exchange Algorithm for Approximation With Linear Restrictions
• Numerical Chebyshev Approximation by Interpolating Rationals
• A Partial Characterization of Poised Hermite–Birkhoff Interpolation Problems