scientific article; zbMATH DE number 3911563
From MaRDI portal
Publication:3687577
[For the entire collection see Zbl 0529.00021.] The definitions of optimal algorithms according to the exactness (analytical complexity) and to the number of operations (algebraic complexity) are given. This is applied for some algorithms of polynomial and fractional-rational best Chebyshev approximation problem. It is shown that an essential increasing of the effectiveness of Remez's algorithm can be achieved, which is based on successive Chebyshev interpolations.
Recommendations
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)