The Remez Exchange Algorithm for Approximation With Linear Restrictions
From MaRDI portal
Publication:4150132
Cites work
- scientific article; zbMATH DE number 3258269 (Why is no real title available?)
- scientific article; zbMATH DE number 3378720 (Why is no real title available?)
- A Unified Approach to Uniform Real Approximation by Polynomials with Linear Restrictions
- Calculation of Best Restricted Approximations
- Convergence de l'algorithme de Remes
- Monotone Approximation by Algebraic Polynomials
- Monotone approximation
- Polynomials of best approximation which are monotone
- The question of uniqueness for G.D. Birkhoff interpolation problems
- Uniform Generalized Weight Function Polynomial Approximation with Interpolation
- Uniform approximation by polynomials having bounded coefficients
- Uniqueness of best approximation by monotone polynomials
Cited in
(5)- Best approximation in \(L^{\infty}\) via iterative Hilbert space procedures
- Approximation on \([0,\infty)\) by reciprocals of polynomials with nonnegative coefficients
- Uniform reciprocal approximation subject to linear constraints
- A unified theory of strong uniqueness in uniform approximation with constraints
- Chebyshev approximation with non-negative derivative
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)
