A note on the complexity of an algorithm for Chebyshev approximation

DOI10.1007/BF01934908zbMath0559.65008OpenAlexW4246309458MaRDI QIDQ2266346

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

complexityuniform approximationcontinuous functionsimplex methodexchange algorithmChebyshev approximationRemes algorithm

Mathematics Subject Classification ID

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

Related Items (1)

On the computational complexity of best Chebyshev approximations

Cites Work

• Unnamed Item
• Unnamed Item
• The Average number of pivot steps required by the Simplex-Method is polynomial

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