Preconditioner based on the Sherman-Morrison formula for regularized least squares problems (Q1049312): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:02, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Preconditioner based on the Sherman-Morrison formula for regularized least squares problems |
scientific article |
Statements
Preconditioner based on the Sherman-Morrison formula for regularized least squares problems (English)
0 references
8 January 2010
0 references
The author proposes a sparse approximate inverse preconditioner based on the Sherman-Morrison formula for Tikhonov regularized least square problems. Theoretical analysis is used to show that the factorization method can take advantage of the symmetric property of the coefficient matrix and be implemented cheaply. A number of incomplete factorization methods are considered and numerical examples are used to conclude that the proposed methods are efficient and superior to existing methods.
0 references
Sherman-Morrison formula
0 references
Tikhonov regularized least squares problem
0 references
Krylov iterative methods
0 references
sparse approximate inverse preconditioner
0 references
incomplete factorization methods
0 references
numerical examples
0 references