Rank revealing LU factorizations

@article{Hwang1992RankRL,
  title={Rank revealing LU factorizations},
  author={T. Hwang and Willis Lin and E. K. Yang},
  journal={Linear Algebra and its Applications},
  year={1992},
  volume={175},
  pages={115-141}
}
Abstract We consider permutations of any given squared matrix and the generalized LU ( r ) factorization of the permuted matrix that reveals the rank deficiency of the matrix. Chan has considered the case with nearly rank deficiency equal to one. This paper extends his results to the case with nearly rank deficiency greater than one. Two applications in constrained optimization are given. We are primarily interested in the existence of such factorizations. In addition to the theories, we also… Expand
30 Citations
Strong rank revealing LU factorizations
Low-rank revealing QR factorizations
CUR Low Rank Approximation of a Matrix at Sub-linear Cost
A Rank-Revealing Method with Updating, Downdating, and Applications. Part II
Generalized fraction-free LU factorization for singular systems with kernel extraction
Computing with Quasiseparable Matrices
  • C. Pernet
  • Computer Science, Mathematics
  • ISSAC
  • 2016
...
1
2
3
...

References

SHOWING 1-10 OF 10 REFERENCES
Rank revealing QR factorizations
The Probability of Large Diagonal Elements in the QR Factorization
  • L. Foster
  • Mathematics, Computer Science
  • SIAM J. Sci. Comput.
  • 1990
Practical Methods of Optimization
Generalized deflated block-elimination
Least squares methods
Least squares methods, in Handbook of Numerical Analysis (P
  • G. Ciarlet and J. L. Lions, Eds.),
  • 1990