Alternation in (weighted) ordinary rational approximation on a subset

DOI10.1016/0021-9045(79)90106-0zbMath0425.41020OpenAlexW2093873987MaRDI QIDQ1135464

Charles B. Dunham

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0021-9045(79)90106-0

zbMATH Keywords

alternationbest weighted uniform approximation

Mathematics Subject Classification ID

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

Related Items (3)

Uniform rational approximation on subsets of [0,\(\infty\)] ⋮ Discrete Chebyshev Approximation: Alternation and the Remez Algorithm ⋮ Nonexistence of best alternating approximations with isolated extrema

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation with reciprocals of polynomials on compact sets
• Rational Approximation with a Vanishing Weight Function and with a Fixed Value at Zero
• Dependence of Best Rational Chebyshev Approximations on the Domain
• A Comparison of Algorithms for Rational l ∞ Approximation
• Transformed rational Chebyshev approximation

This page was built for publication: Alternation in (weighted) ordinary rational approximation on a subset