Block approximate inverse preconditioners for sparse nonsymmetric linear systems (Q964129)
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: Block approximate inverse preconditioners for sparse nonsymmetric linear systems |
scientific article; zbMATH DE number 5692983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Block approximate inverse preconditioners for sparse nonsymmetric linear systems |
scientific article; zbMATH DE number 5692983 |
Statements
Block approximate inverse preconditioners for sparse nonsymmetric linear systems (English)
0 references
14 April 2010
0 references
The authors propose and theoretically analyze a preconditioning technique for block form partitioned matrices. The computation of preconditioners involves consecutive updates of variable rank of an initial and nonsingular matrix and the application of Sherman-Morrison-Woodbury formula to compute an approximate inverse decomposition of the updated matrices.
0 references
approximate inverse preconditioners
0 references
variable rank updates
0 references
block algorithms
0 references
Krylov iterative methods
0 references
Sherman-Morrison-Woodbury formula
0 references
0.9611186
0 references
0.9611186
0 references
0.94500226
0 references
0.9395634
0 references
0.93786216
0 references
0.93487763
0 references
0.9297169
0 references
