scientific article; zbMATH DE number 3942139
From MaRDI portal
Publication:3712892
[For the entire collection see Zbl 0572.00008.] The author makes some remarks on the complexity of an exchange algorithm for Chebychev approximation. This algorithm constructs the best polynomial of uniform approximation to a continuous function defined on a closed interval or a finite point set of real numbers. The author considers the simplest method of an exchange algorithm.
Recommendations
- A note on the complexity of an algorithm for Chebyshev approximation
- The complexity of an \(l_ 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
(8)- On the computational complexity of best Chebyshev approximations
- A note on the performance of the ``Ahrens algorithm
- An efficient algorithm for computing the approximate t-URV and its applications
- A note on the complexity of an algorithm for Chebyshev approximation
- scientific article; zbMATH DE number 4205873 (Why is no real title available?)
- The complexity of an \(l_ p\) method for discrete Tchebycheff approximation in exact arithmetic
- An Algorithm for Computing Continuous Chebyshev Approximations
- scientific article; zbMATH DE number 495874 (Why is no real title available?)
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)