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

DOI10.1515/156939805775122280MaRDI QIDQ5697549zbMATH OpenOpenAlexFDO

Authors V. I. Lebedev, S. A. Finogenov

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

algorithmsChebyshev iterative methodschoice of optimal parameterslinear operator equationsround-off errorsstability

Mathematics Subject Classification ID

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

Recommendations

• On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part I
• scientific article; zbMATH DE number 992922
• scientific article; zbMATH DE number 48351
• Chebyshev polynomial iterations and approximate solutions of linear operator equations
• The Chebyshev iteration revisited

Cites work

• scientific article; zbMATH DE number 3371575 (Why is no real title available?)
• 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

Cited in

(3)

• scientific article; zbMATH DE number 6824981 (Why is no real title available?)
• On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part I
• Chebyshev Petrov-Galerkin method for nonlinear time-fractional integro-differential equations with a mildly singular kernel

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5697549)