Patterns that preserve sparsity in orthogonal factorization

DOI10.1016/S0024-3795(97)00052-9zbMath0891.15008MaRDI QIDQ1375102

Satoru Iwata, D. Dale Olesky, Pauline van den Driessche

Publication date: 8 July 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

QR factorizationpatternsparsityHasse diagrambinary rooted treeHall property

Mathematics Subject Classification ID

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

Cites Work

• Predicting the structure of sparse orthogonal factors
• Sparsity Analysis of the $QR$ Factorization
• Coverings of Bipartite Graphs
• Predicting fill for sparse orthogonal factorization
• Predicting Structure in Sparse Matrix Computations
• Strong Hall Matrices
• Computing the block triangular form of a sparse matrix
• Some Results on Structure Prediction in Sparse $QR$ Factorization
• Unnamed Item

This page was built for publication: Patterns that preserve sparsity in orthogonal factorization