A Data Structure for Sparse $QR$ and $LU$ Factorizations

DOI10.1137/0909008zbMath0648.65019OpenAlexW2015045768WikidataQ114074368 ScholiaQ114074368MaRDI QIDQ3793608

No author found.

Publication date: 1988

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

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

zbMATH Keywords

numerical examplessparse Gaussian eliminationQR factorizationpartial pivotingHouseholder transformationsdata structureLU-factorizationssparse orthogonal decomposition

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

Separators and structure prediction in sparse orthogonal factorization ⋮ Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting ⋮ Block computation and representation of a sparse nullspace basis of a rectangular matrix ⋮ A survey of direct methods for sparse linear systems ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ Predicting the structure of sparse orthogonal factors

Uses Software

• MC21A

This page was built for publication: A Data Structure for Sparse $QR$ and $LU$ Factorizations