Householder reflections versus Givens rotations in sparse orthogonal decomposition

DOI10.1016/0024-3795(87)90111-XzbMath0619.65018MaRDI QIDQ1089725

B. George

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

QR decompositionGivens rotationsHouseholder transformations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Related Items (2)

Accuracy of preconditioned CG-type methods for least squares problems. ⋮ A survey of direct methods for sparse linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of sparse linear least squares problems using Givens rotations
• The natural factor formulation of the stiffness for the matrix displacement method
• A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
• Modification of the minimum-degree algorithm by multiple elimination
• Numerical Methods for Large Sparse Linear Least Squares Problems
• On General Row Merging Schemes for Sparse Givens Transformations
• A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations
• Methods for Modifying Matrix Factorizations
• A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems

This page was built for publication: Householder reflections versus Givens rotations in sparse orthogonal decomposition