Discrete Chebyshev Approximation: Alternation and the Remez Algorithm

DOI10.1002/ZAMM.19790590710zbMath0423.41016OpenAlexW1989742800WikidataQ126254818 ScholiaQ126254818MaRDI QIDQ3857246

Charles B. Dunham

Publication date: 1979

Published in: ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.19790590710

zbMATH Keywords

Remez algorithmdiscrete Chebyshev approximationalternating family

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Best approximation, Chebyshev systems (41A50)

Related Items (9)

The remez algorithm for biased uniform approximation on an interval ⋮ Parameter error estimate of near alternation approximation ⋮ Approximation with one (or few) parameters nonlinear ⋮ A Fortran program for discrete nonlinear Chebyshev approximation ⋮ The one-sided Remez algorithm ⋮ An algorithm for discrete nonlinear biased approximation ⋮ Unnamed Item ⋮ A limit theorem of discretization with weights large on nodes ⋮ Discrete chebyshev approximation with interpolation

Cites Work

• Alternation in (weighted) ordinary rational approximation on a subset
• Chebyshev approximation by \(A + B^*\Phi(CX)\)
• Approximation with reciprocals of polynomials on compact sets
• Characterizability and uniqueness in real Chebyshev approximation
• Alternating Chebyshev Approximation with A Non-Continuous Weight Function
• Minimax nonlinear approximation by approximation on subsets

This page was built for publication: Discrete Chebyshev Approximation: Alternation and the Remez Algorithm