Some generalizations and modifications of iterative methods for solving large sparse symmetric indefinite linear systems (Q1722399)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some generalizations and modifications of iterative methods for solving large sparse symmetric indefinite linear systems |
scientific article; zbMATH DE number 7021972
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some generalizations and modifications of iterative methods for solving large sparse symmetric indefinite linear systems |
scientific article; zbMATH DE number 7021972 |
Statements
Some generalizations and modifications of iterative methods for solving large sparse symmetric indefinite linear systems (English)
0 references
14 February 2019
0 references
Summary: We discuss a variety of iterative methods that are based on the Arnoldi process for solving large sparse symmetric indefinite linear systems. We describe the SYMMLQ and SYMMQR methods, as well as generalizations and modifications of them. Then, we cover the Lanczos/MSYMMLQ and Lanczos/MSYMMQR methods, which arise from a double linear system. We present pseudocodes for these algorithms.
0 references
sparse symmetric indefinite linear systems
0 references
iterative methods
0 references
0 references
0.8975819945335388
0 references
0.8154074549674988
0 references
0.805063784122467
0 references
