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

DOI10.1137/0907031zbMath0596.65013OpenAlexW2093826056WikidataQ123244524 ScholiaQ123244524MaRDI QIDQ3729908

No author found.

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

zbMATH Keywords

QR decompositionHouseholder transformationsCholesky factororthogonal reductionsparse symmetric positive definite systemssparse least squares

Mathematics Subject Classification ID

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

Related Items (5)

Accuracy of preconditioned CG-type methods for least squares problems. ⋮ Solving combinatorial optimization problems using Karmarkar's algorithm ⋮ A survey of direct methods for sparse linear systems ⋮ Sparse QR factorization on a massively parallel computer ⋮ The generalized Householder transformation and sparse matrices

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