Alternation in (weighted) ordinary rational approximation on a subset
From MaRDI portal
Publication:1135464
DOI10.1016/0021-9045(79)90106-0zbMath0425.41020MaRDI QIDQ1135464
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
Related Items
Uniform rational approximation on subsets of [0,\(\infty\)], Nonexistence of best alternating approximations with isolated extrema, Discrete Chebyshev Approximation: Alternation and the Remez Algorithm
Cites Work
- 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
- Unnamed Item
- Unnamed Item