Preconditioner based on the Sherman-Morrison formula for regularized least squares problems (Q1049312): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2009.09.048 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003350194 / rank | |||
Normal rank | |||
Revision as of 21:56, 19 March 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
