Computing projections with LSQR (Q678216): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LSQR / rank | |||
Normal rank | |||
Revision as of 19:23, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing projections with LSQR |
scientific article |
Statements
Computing projections with LSQR (English)
0 references
17 September 1997
0 references
LSQR uses the Golub-Kahan bidiagonalization process to solve sparse least squares problems with and without regularization. In some cases, projections of the right-hand side vector are needed, rather than the least squares solution itself. It is shown that projections as well as the least squares solutions may be obtained from the bidiagonalization as linear combinations of the theoretically orthogonal vectors.
0 references
LSQR
0 references
Golub-Kahan bidiagonalization
0 references
sparse least squares problems
0 references
regularization
0 references
