Convergence of the Fraser-Hart Algorithm for Rational Chebyshev Approximation

DOI10.2307/2005745zbMath0309.41024OpenAlexW4230802060MaRDI QIDQ4067525

Charles B. Dunham

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2005745

Mathematics Subject Classification ID

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

Related Items (6)

Double precision rational approximation algorithm for the inverse standard normal second order loss function ⋮ Solving nonlinear systems of equations with only one nonlinear variable ⋮ Biased rational Chebyshev approximation ⋮ Double precision rational approximation algorithm for the inverse standard normal first order loss function ⋮ Double precision rational approximation algorithms for the standard normal first and second order loss functions ⋮ Approximation with reciprocals of polynomials on compact sets

Cites Work

• Unnamed Item
• Unnamed Item
• Rational Chebyshev approximation by Remes' algorithms
• Rational Chebyshev approximation using linear equations
• On the Remez algorithm for non-linear families
• On the computation of rational approximations to continuous functions

This page was built for publication: Convergence of the Fraser-Hart Algorithm for Rational Chebyshev Approximation