On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part I

DOI10.1515/rnam-2002-0506zbMath1032.65059OpenAlexW4242867342MaRDI QIDQ4792951

S. A. Finogenov, V. I. Lebedev

Publication date: 8 March 2004

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/rnam-2002-0506

zbMATH Keywords

stabilityHilbert spacelinear operator equationresidual operatorsoptimal choice of parametersill-conditioned equationsround off errorsChebyshev iterative methodscyclic iterative methods

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)

Related Items (4)

A computational strategy for multiscale systems with applications to Lorenz 96 model ⋮ On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part II ⋮ Some algorithms for computing Chebyshev normalized first-kind polynomials by roots ⋮ On the equivalence between the scheduled relaxation Jacobi method and Richardson's non-stationary method

This page was built for publication: On construction of the stable permutations of parameters for the Chebyshev iterative methods. Part I