Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems (Q1070768)
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: Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems |
scientific article |
Statements
Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems (English)
0 references
1985
0 references
The G-algorithm of \textit{E.H. Bareiss} [SIAM J. Algebraic Discrete Methods (to appear)] for solving the weighted linear least squares problem is studied. The error analysis of this algorithm presented here is shown to be as stable as any of the standard orthogonal decomposition methods for solving least squares problems.
0 references
G-algorithm
0 references
weighted linear least squares problem
0 references
error analysis
0 references
orthogonal decomposition methods
0 references
0 references
0 references
