scientific article; zbMATH DE number 3911563

MaRDI QIDQ3687577zbMATH OpenFDO

Authors

Publication date 1983

zbMATH Keywords

algebraic complexityanalytical complexityoptimal algorithmsRemez's algorithmsuccessive Chebyshev interpolations

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Approximation by rational functions (41A20) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A Fast Algorithm for Linear Complex Chebyshev Approximations
• Increasing the efficiency of Chebyshev segment fractional rational approximation
• scientific article; zbMATH DE number 3956305
• A note on the complexity of an algorithm for Chebyshev approximation
• scientific article; zbMATH DE number 19426

Cited in

(6)

• A note on the complexity of an algorithm for Chebyshev approximation
• Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
• scientific article; zbMATH DE number 3956305 (Why is no real title available?)
• scientific article; zbMATH DE number 646755 (Why is no real title available?)
• Chebyshev's approximation algorithms and applications
• Increasing the efficiency of Chebyshev segment fractional rational approximation

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 Q3687577)