The Remez Exchange Algorithm for Approximation With Linear Restrictions

DOI10.2307/1997519zbMATH Open0372.41016OpenAlexW4255382456MaRDI QIDQ4150132FDOQ4150132

Authors: B. 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) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50)

Cites Work

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

Cited In (5)

• Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures
• Chebyshev approximation with non-negative derivative
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4150132)