Chebyshev polynomials are not always optimal

DOI10.1016/0021-9045(91)90091-NzbMath0738.41027OpenAlexW2065176245MaRDI QIDQ1177058

Bernd Fischer, Roland W. Freund

Publication date: 25 June 1992

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(91)90091-n

zbMATH Keywords

optimal polynomialChebyshev polynomialconstrained approximation problem

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)

Related Items (10)

A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations ⋮ Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems ⋮ Asymptotics of Chebyshev polynomials. V: Residual polynomials ⋮ Nonlinear acceleration of momentum and primal-dual algorithms ⋮ Milestones in the development of iterative solution methods ⋮ Convergence analysis of Krylov subspace methods ⋮ On acceleration methods for coupled nonlinear elliptic systems ⋮ Convergence properties of block GMRES and matrix polynomials ⋮ The convergence of Krylov subspace methods for large unsymmetric linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the constrained Chebyshev approximation problem on ellipses
• Some remarks on uniform asymptotic expansions for Bessel functions
• The Tchebychev iteration for nonsymmetric linear systems
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• A restarted version of a generalized preconditioned conjugate gradient method
• A Unified Approach to Certain Problems of Approximation and Minimization
• Accelerating the Jacobi Method for Solving Simultaneous Equations by Chebyshev Extrapolation When the Eigenvalues of the Iteration Matrix are Complex

This page was built for publication: Chebyshev polynomials are not always optimal