Improved bound for rank revealing LU factorizations

DOI10.1016/S0024-3795(96)00397-7zbMath0883.65020WikidataQ114122553 ScholiaQ114122553MaRDI QIDQ1362659

Tsung-Min Hwang, Wen-Wei Lin, Daniel J. Pierce

Publication date: 29 March 1998

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

zbMATH Keywords

sparse matrices; rank of a matrix; rank deficient linear systems of equations; rank revealing LU factorization; rank revealing QR factorization

Mathematics Subject Classification ID

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

On the existence and computation of rank-revealing LU factorizations, Strong rank revealing LU factorizations, Optimal CUR Matrix Decompositions

Cites Work

• Unnamed Item
• Rang revealing QR factorizations
• Rank revealing \(LU\) factorizations
• Numerical methods for solving linear least squares problems
• Sparse Multifrontal Rank Revealing QR Factorization
• The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
• The Probability of Large Diagonal Elements in the $QR$ Factorization
• On the Existence and Computation of LU-Factorizations with Small Pivots
• Error Analysis of Direct Methods of Matrix Inversion
• Structure-Preserving and Rank-Revealing QR-Factorizations
• Rank-Revealing QR Factorizations and the Singular Value Decomposition
• Some Applications of the Rank Revealing QR Factorization
• Rank Detection Methods for Sparse Matrices
• On Rank-Revealing Factorisations
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization