Regularization by truncated Cholesky factorization: a comparison of four different approaches (Q883332): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jco.2006.07.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073080923 / rank | |||
Normal rank | |||
Revision as of 08:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regularization by truncated Cholesky factorization: a comparison of four different approaches |
scientific article |
Statements
Regularization by truncated Cholesky factorization: a comparison of four different approaches (English)
0 references
4 June 2007
0 references
Due to the principle of regularization by restricting the number of degrees of freedom, truncating the Cholesky factorization of a symmetric positive definite matrix can be expected to have a stabilizing effect. Based on this idea, the author considers four different approaches for regularizing ill-posed linear operator equations. Convergence in the noise free case and in the situation of noisy data is analyzed. Numerical tests illustrate the theoretical results.
0 references
regularization
0 references
Cholesky factorization
0 references
numerical examples
0 references
ill-posed linear operator equations
0 references
