Recursive ULV decomposition

Hasan Erbay, Jesse L. Barlow

Research output: Contribution to journalConference articlepeer-review

6 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 ULVD can be modified much faster than the SVD. The accurate computation of the subspaces is required in applications in signal processing. In this paper we introduce a recursive ULVD algorithm which is faster than all available stable SVD algorithms. Moreover, we present an alternative refinement algorithm.

Original languageEnglish (US)
Pages (from-to)157-166
Number of pages10
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - Dec 1 2000
EventAdvance Signal Processing Algorithms, Atchitectures, and Implementations X - San diego, CA, USA
Duration: Aug 2 2000Aug 4 2000

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'Recursive ULV decomposition'. Together they form a unique fingerprint.

Cite this