Row Ordering for a Sparse QR Decomposition

DOI10.1137/S0895479890185641MaRDI QIDQ4313374zbMATH OpenFDO

Authors Thomas Robey, Deborah Sulsky

Publication date 16 November 1994

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

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

zbMATH Keywords

QR decompositionrow ordering strategysparse matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50)

Recommendations

• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model
• Ordering Givens Rotations for Sparse QR Factorization
• Rang revealing QR factorizations
• Row-ordering schemes for sparse Givens transformations. II. Implicit graph model

Cited in

(8)

• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
• On General Row Merging Schemes for Sparse Givens Transformations
• The primal mixed finite element method and the LBB condition
• A parallel balance scheme for banded linear systems
• Ordering Givens Rotations for Sparse QR Factorization
• A survey of direct methods for sparse linear systems
• On the QR decomposition of \({\mathcal {H}}\)-matrices

This page was built for publication: Row Ordering for a Sparse QR Decomposition

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