A ``look-around Lanczos'' algorithm for solving a system of linear equations (Q1381376)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1129529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A ``look-around Lanczos'' algorithm for solving a system of linear equations |
scientific article; zbMATH DE number 1129529 |
Statements
A ``look-around Lanczos'' algorithm for solving a system of linear equations (English)
0 references
27 October 1998
0 references
The author proposes two iterative algorithms to solve large sparse linear systems of equations. The first one is a modification of Lanczos' method and the second is based on one of Brezinski's extrapolation methods. Lanczos methods may break down [see e.g. \textit{R. W. Freund, M. H. Gutknecht} and \textit{N. M. Nachtigal}, SIAM J. Sci. Comput 14, No. 1, 137-158 (1993; Zbl 0770.65022)] and have to be stabilized by a look-ahead strategy. The author proposes a new ``look-around Lanczos'' algorithm to overcome these problems.
0 references
sparse linear systems
0 references
Lanczos algorithm
0 references
Padé approximation
0 references
iterative methods
0 references
Brezinski's extrapolation methods
0 references
look-ahead strategy
0 references
0.8208271861076355
0 references
0.806041419506073
0 references
0.8026165962219238
0 references
