The DOI matches its Crossref record.
A Singular Value Decomposition Updating Algorithm for Subspace Tracking
Abstract
In this paper, the well-known QR updating scheme is extended to a similar but more versatile and generally applicable scheme for updating the singular value decomposition (SVD). This is done by supplementing the QR updating with a Jacobi-type SVD procedure, where apparently only a few SVD steps after each QR update suffice in order to restore an acceptable approximation for the SVD. This then results in a reduced computational cost, comparable to the cost for merely QR updating. The usefulness of such an approximate updating scheme when applied to subspace tracking is examined. It is shown how an $\mathcal{O}(n^2 )$ SVD updating algorithm can restore an acceptable approximation at every stage, with a fairly small tracking error of approximately the time variation in $\mathcal{O}(n)$ time steps. Finally, an error analysis is performed, proving that the algorithm is stable, when supplemented with a Jacobi-type reorthogonalization procedure, which can easily be incorporated into the updating scheme.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
Diagnosing network-wide traffic anomalies
Lakhina, A., Crovella, M., & Diot, C. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015492 · Cited by 1,039
Diagnosing network-wide traffic anomalies
Lakhina, A., Crovella, M., & Diot, C. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1030194.1015492 · Cited by 419
GSVD-based optimal filtering for single and multimicrophone speech enhancement
Doclo, S., & Moonen, M. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.801937 · Cited by 379
Self-citationSubspace-based signal analysis using singular value decomposition
Van Der Veen, A.-J., Deprettere, E. F., & Swindlehurst, A. L. (1993) · Proceedings of the IEEE · doi:10.1109/5.237536 · Cited by 348
Doclo, S., & Moonen, M. (2003) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/s111086570330602x · Cited by 96
Self-citation
Metadata
- Authors
- Moonen, M., Van Dooren, P., & Vandewalle, J.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 1992-10
- Volume
- 13
- Issue
- 4
- Pages
- 1015-1038
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2028213769
- Cited by
- 176
- References
- 0
- FWCI
- 8.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.