Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations

DOI10.1137/0907031zbMATH Open0596.65013OpenAlexW2093826056WikidataQ123244524 ScholiaQ123244524MaRDI QIDQ3729908FDOQ3729908

Authors:

Publication date: 1986

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0907031

Recommendations

• Householder reflections versus Givens rotations in sparse orthogonal decomposition
• The generalized Householder transformation and sparse matrices
• A Data Structure for Sparse $QR$ and $LU$ Factorizations
• Separators and structure prediction in sparse orthogonal factorization
• scientific article; zbMATH DE number 1226271

zbMATH Keywords

QR decompositionHouseholder transformationsCholesky factororthogonal reductionsparse symmetric positive definite systemssparse least squares

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25)

Cited In (7)

• Householder reflections versus Givens rotations in sparse orthogonal decomposition
• A survey of direct methods for sparse linear systems
• Sparse QR factorization on a massively parallel computer
• A Data Structure for Sparse $QR$ and $LU$ Factorizations
• Accuracy of preconditioned CG-type methods for least squares problems.
• The generalized Householder transformation and sparse matrices
• Solving combinatorial optimization problems using Karmarkar's algorithm

This page was built for publication: Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3729908)