An efficient rank detection procedure for modifying the ULV decomposition

Peter A. Yoon, Jesse L. Barlow

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). The problem of adding and deleting rows from the ULVD (called updating and downdating, respectively) is considered. The ULVD can be updated and downdated much faster than the SVD, hence its utility. When updating or downdating the ULVD, it is necessary to compute its numerical rank. In this paper, we propose an efficient algorithm which almost always maintains rank-revealing structure of the decomposition after an update or downdate without standard condition estimation. Moreover, we can monitor the accuracy of the information provided by the ULVD as compared to the SVD by tracking exact Frobenius norms of the two small blocks of the lower triangular factor in the decomposition.

Original languageEnglish (US)
Pages (from-to)781-801
Number of pages21
JournalBIT Numerical Mathematics
Issue number4
StatePublished - Dec 1998

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'An efficient rank detection procedure for modifying the ULV decomposition'. Together they form a unique fingerprint.

Cite this