Patterns that preserve sparsity in orthogonal factorization

DOI10.1016/S0024-3795(97)00052-9MaRDI QIDQ1375102zbMATH OpenFDO

Authors Satoru Iwata, D. D. Olesky, P. van den Driessche

Publication date 8 July 1998

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

zbMATH Keywords

sparsitypatternQR factorizationbinary rooted treeHasse diagramHall property

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

• Sparsity Analysis of the $QR$ Factorization
• Some Results on Structure Prediction in Sparse $QR$ Factorization
• Predicting fill for sparse orthogonal factorization
• Separators and structure prediction in sparse orthogonal factorization
• scientific article; zbMATH DE number 554767

Cites work

• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• Computing the block triangular form of a sparse matrix
• Coverings of Bipartite Graphs
• Predicting Structure in Sparse Matrix Computations
• Predicting fill for sparse orthogonal factorization
• Predicting the structure of sparse orthogonal factors
• Some Results on Structure Prediction in Sparse $QR$ Factorization
• Sparsity Analysis of the $QR$ Factorization
• Strong Hall Matrices

Cited in

(2)

• Separators and structure prediction in sparse orthogonal factorization
• Sparsity Analysis of the $QR$ Factorization

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

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