Choice of Basis for Chebyshev Approximation

DOI10.1145/355984.355987zbMath0492.41002OpenAlexW2033125239MaRDI QIDQ3954243

Charles B. Dunham

Publication date: 1982

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355984.355987

zbMATH Keywords

condition numbersRemez algorithmChebyshev polynomial basisFraser-Hart-Remez algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20) Approximation by polynomials (41A10) Software, source code, etc. for problems pertaining to approximations and expansions (41-04)

Related Items (4)

Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems ⋮ Barycentric-Remez algorithms for best polynomial approximation in the chebfun system ⋮ Dependence of alternants of functions ⋮ A Chebychev-Vandermonde solver

This page was built for publication: Choice of Basis for Chebyshev Approximation