Rank Detection Methods for Sparse Matrices

DOI10.1137/0613078MaRDI QIDQ4021622zbMATH OpenOpenAlexFDO

Authors Jesse L. Barlow, Udaya B. Vemulapati

Publication date 16 January 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/0613078

zbMATH Keywords

sparse matrixorthogonal factorizationcondition estimatormessage- passing architecturesrank detection method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Recommendations

• Sparse Multifrontal Rank Revealing QR Factorization
• Computing rank-revealing QR factorizations of dense matrices
• A block algorithm for computing rank-revealing QR factorizations
• Algorithm 933
• Structure-Preserving and Rank-Revealing QR-Factorizations

Cited in

(4)

• Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
• Incremental norm estimation for dense and sparse matrices
• Rank-Sparsity Incoherence for Matrix Decomposition
• Improved bound for rank revealing LU factorizations

Describes a project that uses

Uses Software

• SPARSPAK

This page was built for publication: Rank Detection Methods for Sparse Matrices

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