Block approximate inverse preconditioners for sparse nonsymmetric linear systems (Q964129): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SPARSKIT / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:45, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Block approximate inverse preconditioners for sparse nonsymmetric linear systems |
scientific article |
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
