Efficient algorithms for block downdating of least squares solutions (Q1826598)
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: Efficient algorithms for block downdating of least squares solutions |
scientific article; zbMATH DE number 2081653
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for block downdating of least squares solutions |
scientific article; zbMATH DE number 2081653 |
Statements
Efficient algorithms for block downdating of least squares solutions (English)
0 references
6 August 2004
0 references
Five computationally efficient algorithms for solving least squares problems, which use block versions of Givens rotations are given. The complexities of the algorithms are derived and analyzed. The performance of the implementations confirms the theoretical results.
0 references
least squares
0 references
QR decomposition
0 references
Givens rotations
0 references
Householder transformations
0 references
downdating
0 references
algorithms
0 references
complexities
0 references
performance
0 references
0 references
0 references
0 references
0 references
0.95473063
0 references
0.9157989
0 references
0.9011674
0 references
0.89975667
0 references
0.8872844
0 references
0.8824317
0 references
