An alternative algorithm for a sliding window ULV decomposition

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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)
Volume76
Issue number1-2
DOIs
StatePublished - Jan 1 2006

Fingerprint

Sliding Window
Singular value decomposition
Decompose
Alternatives
Signal processing
Orthogonal Decomposition
Updating
Signal Processing
Time-varying
Subspace

All Science Journal Classification (ASJC) codes

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

Cite this

@article{a2263328701145a3a86299ac2ceab872,
title = "An alternative algorithm for a sliding window ULV decomposition",
abstract = "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.",
author = "H. Erbay and Barlow, {Jesse Louis}",
year = "2006",
month = "1",
day = "1",
doi = "10.1007/s00607-005-0124-4",
language = "English (US)",
volume = "76",
pages = "55--66",
journal = "Computing (Vienna/New York)",
issn = "0010-485X",
publisher = "Springer Wien",
number = "1-2",

}

An alternative algorithm for a sliding window ULV decomposition. / Erbay, H.; Barlow, Jesse Louis.

In: Computing (Vienna/New York), Vol. 76, No. 1-2, 01.01.2006, p. 55-66.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An alternative algorithm for a sliding window ULV decomposition

AU - Erbay, H.

AU - Barlow, Jesse Louis

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=27644485911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=27644485911&partnerID=8YFLogxK

U2 - 10.1007/s00607-005-0124-4

DO - 10.1007/s00607-005-0124-4

M3 - Article

AN - SCOPUS:27644485911

VL - 76

SP - 55

EP - 66

JO - Computing (Vienna/New York)

JF - Computing (Vienna/New York)

SN - 0010-485X

IS - 1-2

ER -