zbMATH — the first resource for mathematics

Improvement of the two-step Richardson algorithm. (English. Russian original) Zbl 0855.65020
Cybern. Syst. Anal. 31, No. 6, 927-930 (1995); translation from Kibern. Sist. Anal. 1995, No. 6, 166-169 (1995).
Summary: The structure is refined and a priori estimates are suggested for a two-cycle iterative Richardson algorithm proposed earlier by the author.
65F10 Iterative numerical methods for linear systems
65B05 Extrapolation to the limit, deferred corrections
Full Text: DOI
[1] A. V. Buledza, ”Two-step versions of the iterative Richardson method,” Kibernetika, No. 2, 35–40 46 (1987).
[2] A. V. Buledza, ”Modern issues in the development of the theory of iterative methods with Chebyshev acceleration,” Kibern. Sist. Anal., No. 4, 105–116 (1992). · Zbl 0875.65052
[3] D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Fizmatgiz, Moscow-Leningrad (1963). · Zbl 0112.07503
[4] N. S. Bakhvalov, N. P. Zhidkov, and G. M. Kobel’kov, Numerical Methods [in Russian], Nauka, Moscow (1987).
[5] V. I. Lebedev and S. A. Finogenov, ”On the order of selection of iteration parameters in the Chebyshev cyclic iteration method,” Zh. Vychisl. Matem. i Mat. Fiziki,11, No. 2, 425–438 (1971). · Zbl 0221.65099
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.