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

sparse matrixalgorithm\(QR\) factorizationsparsity patternHall propertysymbolic factorizationgraphs and matrices\(QR\)-decomposition

Mathematics Subject Classification ID

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

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

(9)

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

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)