scientific article; zbMATH DE number 3859676
[For the entire collection see Zbl 0533.00014.] Best rational Chebyshev approximations that can be computed algebraically, i.e. by solving an eigenvalue problem, have been a matter of interest for a long time. On the basis of the Carathéodory-Fejér method a general and unified theory is derived for such approximations on a disk (complex) and on an interval (real), respectively. The latter case extends to real rational trigonometric approximations. The given function must be a rational function of higher numerator or denominator degree. The theory seems to cover all known cases of nontrivially algebraically computable best approximations and even most of those classes of Chebyshev approximations where the solution is known explicitly. (Polynomial approximations are of course included.)
- The algebraic fractions of Chebyshev and Markov on several segments
- scientific article; zbMATH DE number 3859674 (Why is no real title available?)
- Real VS. Complex Rational Chebyshev Approximation on an Interval
- scientific article; zbMATH DE number 4157193 (Why is no real title available?)
- scientific article; zbMATH DE number 1047615 (Why is no real title available?)
- scientific article; zbMATH DE number 934500 (Why is no real title available?)
- An algorithm for real and complex rational minimax approximation
- Chebyshev's approximation algorithms and applications
- A robust implementation of the Carathéodory-Fejér method for 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 Q3327077)