The Remez Exchange Algorithm for Approximation With Linear Restrictions

DOI10.2307/1997519zbMath0372.41016OpenAlexW4255382456MaRDI QIDQ4150132

Bruce L. Chalmers

Publication date: 1976

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

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Best approximation, Chebyshev systems (41A50) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)

Related Items (5)

Chebyshev approximation with non-negative derivative ⋮ Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures ⋮ A unified theory of strong uniqueness in uniform approximation with constraints ⋮ Approximation on \([0,\infty)\) by reciprocals of polynomials with nonnegative coefficients ⋮ Uniform reciprocal approximation subject to linear constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomials of best approximation which are monotone
• Convergence de l'algorithme de Remes
• Monotone approximation
• The question of uniqueness for G.D. Birkhoff interpolation problems
• Uniform approximation by polynomials having bounded coefficients
• Uniqueness of best approximation by monotone polynomials
• Monotone Approximation by Algebraic Polynomials
• Uniform Generalized Weight Function Polynomial Approximation with Interpolation
• Calculation of Best Restricted Approximations
• A Unified Approach to Uniform Real Approximation by Polynomials with Linear Restrictions

This page was built for publication: The Remez Exchange Algorithm for Approximation With Linear Restrictions