scientific article; zbMATH DE number 3942139

MaRDI QIDQ3712892zbMATH OpenFDO

Authors Allen A. Goldstein

Publication date 1985

zbMATH Keywords

exchange algorithmiterationChebychev approximationTaylor's theorembest polynomial of uniform approximation

Mathematics Subject Classification ID

Approximation by positive operators (41A36) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Recommendations

• A note on the complexity of an algorithm for Chebyshev approximation
• The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic
• A Multiple-Exchange Algorithm for Complex Chebyshev Approximation by Polynomials on the Unit Circle
• scientific article; zbMATH DE number 4115210
• On the computational complexity of best Chebyshev approximations

Cited in

(7)

• An Algorithm for Computing Continuous Chebyshev Approximations
• An efficient algorithm for computing the approximate t-URV and its applications
• On the computational complexity of best Chebyshev approximations
• The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic
• scientific article; zbMATH DE number 495874 (Why is no real title available?)
• A note on the complexity of an algorithm for Chebyshev approximation
• A note on the performance of the ``Ahrens algorithm

This page was built for publication:

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