The Remez Exchange Algorithm for Approximation With Linear Restrictions
From MaRDI portal
Publication:4150132
DOI10.2307/1997519zbMath0372.41016MaRDI QIDQ4150132
Publication date: 1976
Full work available at URL: https://doi.org/10.2307/1997519
65D10: Numerical smoothing, curve fitting
41A50: Best approximation, Chebyshev systems
41A05: Interpolation in approximation theory
41A10: Approximation by polynomials
Related Items
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, Chebyshev approximation with non-negative derivative, Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures
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
