A note on the complexity of an algorithm for Chebyshev approximation

DOI10.1007/BF01934908MaRDI QIDQ2266346zbMATH OpenOpenAlexFDO

Authors Allen A. Goldstein

Publication date 1984

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01934908

zbMATH Keywords

Chebyshev approximationcomplexitycontinuous functionexchange algorithmRemes algorithmsimplex methoduniform approximation

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• The Average number of pivot steps required by the Simplex-Method is polynomial

Cited in

(9)

• Using a computer to obtain Chebotarev bounds in the nonhomogeneous Minkowski's conjecture
• On the computational complexity of best Chebyshev approximations
• scientific article; zbMATH DE number 5080397 (Why is no real title available?)
• A Fast Algorithm for Linear Complex Chebyshev Approximations
• scientific article; zbMATH DE number 3911563 (Why is no real title available?)
• scientific article; zbMATH DE number 3942139 (Why is no real title available?)
• scientific article; zbMATH DE number 19426 (Why is no real title available?)
• scientific article; zbMATH DE number 646755 (Why is no real title available?)
• Chebyshev's approximation algorithms and applications

This page was built for publication: A note on the complexity of an algorithm for Chebyshev approximation

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