Some algorithms for computing Chebyshev normalized first-kind polynomials by roots

DOI10.1515/156939805775122280zbMath1118.65334OpenAlexW4236569700MaRDI QIDQ5697549

S. A. Finogenov, V. I. Lebedev

Publication date: 18 October 2005

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/156939805775122280

zbMATH Keywords

algorithmsstabilitylinear operator equationsround-off errorschoice of optimal parametersChebyshev iterative methods

Mathematics Subject Classification ID

Dilations, extensions, compressions of linear operators (47A20) Numerical solutions to equations with linear operators (65J10)

Cites Work

• On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part I
• Ordering of the iterative parameters in the cyclical Chebyshev iterative method
• Unnamed Item

This page was built for publication: Some algorithms for computing Chebyshev normalized first-kind polynomials by roots