Improved bound for rank revealing LU factorizations

Tsung Min Hwang*, Wen Wei Lin, Daniel Pierce

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


In many applications it is necessary to determine the rank (or numerical rank) of a matrix. Many of these situations involve matrices that are very large order or that are sparse or that may undergo some form of modification (rank-k update, row or column appended or removed). In these cases the singular value decomposition's cost may be prohibitively high or the decomposition may not be computationally feasible (especially for large sparse problems). We thus examine the theoretical merits of rank revealing LU (RRLU) factorizations. We find that in those cases where the nullity is small and the gap is well defined, an RRLU factorization could be a very useful tool.

Original languageEnglish
Pages (from-to)173-186
Number of pages14
JournalLinear Algebra and Its Applications
Issue number1-3
Publication statusPublished - 1997 Aug
Externally publishedYes

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Improved bound for rank revealing LU factorizations'. Together they form a unique fingerprint.

Cite this