Choice of Basis for Chebyshev Approximation

DOI10.1145/355984.355987MaRDI QIDQ3954243zbMATH OpenOpenAlexFDO

Authors 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

Chebyshev polynomial basiscondition numbersFraser-Hart-Remez algorithmRemez algorithm

Mathematics Subject Classification ID

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

Cited in

(5)

• Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
• Dependence of alternants of functions
• A Chebychev-Vandermonde solver
• Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
• VDR decomposition of Chebyshev-Vandermonde matrices with the Arnoldi Process

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

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