Leapfrog variants of iterative methods for linear algebraic equations (Q1112547): Difference between revisions
From MaRDI portal
Latest revision as of 10:11, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Leapfrog variants of iterative methods for linear algebraic equations |
scientific article |
Statements
Leapfrog variants of iterative methods for linear algebraic equations (English)
0 references
1988
0 references
Let be \(x^{(i)}\) the sequence generated by an iterative method to solve the real or complex linear system \(Ax=b\). A leapfrog method is a variant such that \(x^{(i)}\) can be expressed directly in terms of \(x^{(i- 2)}\), and a grand-leap method expresses \(x^{(i)}\) directly by \(x^{(0)}\) without computation of intermediate iterates. These two methods are considered for Richardson's method, in particular for the Chebyshev case, and for a general second order method. Six different algorithms are presented and discussed, they include the calculation of the required parameters. The advantages of the methods concerning their efficiency on supercomputers are pointed out.
0 references
numerical examples
0 references
iterative method
0 references
leapfrog method
0 references
grand-leap method
0 references
Richardson's method
0 references
second order method
0 references
supercomputers
0 references