On the existence and computation of rank-revealing LU factorizations

@article{Pan2000OnTE,
  title={On the existence and computation of rank-revealing LU factorizations},
  author={C. Pan},
  journal={Linear Algebra and its Applications},
  year={2000},
  volume={316},
  pages={199-222}
}
  • C. Pan
  • Published 2000
  • Mathematics
  • Linear Algebra and its Applications
Abstract By exploring properties of Schur complements, this paper presents bounds on the existence of rank-revealing LU factorizations that are comparable with those of rank-revealing QR factorizations. The new bounds provide substantial improvement over previously derived bounds. This paper also proposes two algorithms using Gaussian elimination with a “block pivoting” strategy to select a subset of columns from a given matrix which has a guaranteed relatively large smallest singular value… Expand
164 Citations
Rank revealing Gaussian elimination by the maximum volume concept
  • 3
  • Highly Influenced
  • PDF
Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
  • 19
  • Highly Influenced
  • PDF
COMPARISON OF RANK REVEALING ALGORITHMS APPLIED TO MATRICES WITH WELL DEFINED NUMERICAL RANKS
  • 15
  • Highly Influenced
  • PDF
Efficient Spectrum-Revealing CUR Matrix Decomposition
  • 1
  • PDF
High Resolution Methods Based On Rank Revealing Triangular Factorizations
  • 10
  • Highly Influenced
Strong rank revealing LU factorizations
  • 83
  • PDF
A Rank-Revealing Method with Updating, Downdating, and Applications. Part II
  • 31
  • PDF
TR-2012005: Randomized Matrix Computations
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 19 REFERENCES
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
  • 551
  • PDF
Rank revealing QR factorizations
  • 376
Rank revealing LU factorizations
  • 30
  • PDF
Computing rank-revealing QR factorizations of dense matrices
  • 134
  • PDF
On Rank-Revealing Factorisations
  • 126
  • PDF
...
1
2
...