An alternative algorithm for a sliding window ULV decomposition

H. Erbay, Jesse Louis Barlow

Research output: Contribution to journalArticlepeer-review

2 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. When modifiying the ULVD, the accurate computation of the subspaces is required in certain time varying applications in signal processing. In this paper, we present an updating algorithm which is suitable for large scaled matrices of low rank and as effective as alternatives. The algorithm runs in O(n 2) time.

Original languageEnglish (US)
Pages (from-to)55-66
Number of pages12
JournalComputing (Vienna/New York)
Issue number1-2
StatePublished - Jan 2006

All Science Journal Classification (ASJC) codes

  • Software
  • Computational Mathematics
  • Theoretical Computer Science
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'An alternative algorithm for a sliding window ULV decomposition'. Together they form a unique fingerprint.

Cite this