Computing projections with LSQR (Q678216)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing projections with LSQR |
scientific article; zbMATH DE number 1000366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing projections with LSQR |
scientific article; zbMATH DE number 1000366 |
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
0.85041356
0 references
0.8481378
0 references
0 references
0.8441021
0 references
0.8415687
0 references
0.84050125
0 references
0.83801645
0 references
0.83528465
0 references
0.83400875
0 references
