scientific article; zbMATH DE number 3942139

zbMATH Open0587.41020MaRDI QIDQ3712892FDOQ3712892

Authors: Allen A. Goldstein 

Publication date: 1985

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

• 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
• Title not available (Why is that?)
• A note on the complexity of an algorithm for Chebyshev approximation
• An Algorithm for Computing Continuous Chebyshev Approximations
• 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)