Sparsity Analysis of the QR Factorization

DOI10.1137/0614046MaRDI QIDQ3136538zbMATH OpenOpenAlexFDO

Authors Donovan R. Hare, Charles R. Johnson, D. D. Olesky, P. van den Driessche

Publication date 18 October 1993

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

\(QR\) factorization\(QR\)-decompositionalgorithmgraphs and matricesHall propertysparse matrixsparsity patternsymbolic factorization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Ordering Givens Rotations for Sparse QR Factorization
• On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices
• Patterns that preserve sparsity in orthogonal factorization
• Computing row and column counts for sparse QR and LU factorization
• A Data Structure for Sparse QR and LU Factorizations

Cited in

(10)

• Predicting the structure of sparse orthogonal factors
• Separators and structure prediction in sparse orthogonal factorization
• Patterns that preserve sparsity in orthogonal factorization
• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
• scientific article; zbMATH DE number 4109938 (Why is no real title available?)
• Low‐rank revealing QR factorizations
• Ordering Givens Rotations for Sparse QR Factorization
• Theww^Tfactorization of dense and sparse matrices
• A survey of direct methods for sparse linear systems
• Sparse linear least-squares problems

This page was built for publication: Sparsity Analysis of the $QR$ Factorization

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