A Comparison of Algorithms for Rational l ∞ Approximation

DOI10.2307/2005252zbMath0257.65018OpenAlexW4254128539MaRDI QIDQ5672049

No author found.

Publication date: 1973

Published in: Mathematics of Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items (16)

The differential correction algorithm for generalized rational functions ⋮ On the optimum approximation of real rational functions via linear programming ⋮ Evaluation of functions on microcomputers: rational approximation of kth roots ⋮ An algorithm for Chebyshev approximation by rationals with constrained denominators ⋮ Alternation in (weighted) ordinary rational approximation on a subset ⋮ DCR 2: An improved algorithm for \(\ell_\infty\) rational approximation on intervals ⋮ A combined Remes-differential correction algorithm for rational approximation: Experimental results ⋮ Uniform approximation by rational functions having restricted denominators ⋮ A comprehensive study of the mathematical methods used to approximate the inverse Langevin function ⋮ An Algorithm for Real and Complex Rational Minimax Approximation ⋮ Approximation with reciprocals of polynomials on compact sets ⋮ L^∞-Norm minimal control of the wave equation: on the weakness of the bang-bang principle ⋮ Nonexistence of best alternating approximations with isolated extrema ⋮ An adaptive differential correction algorithm ⋮ The linear inequality method for rational approximation with interpolation ⋮ Stability of the linear inequality method for rational Chebyshev approximation

This page was built for publication: A Comparison of Algorithms for Rational l ∞ Approximation