The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Tracking a few extreme singular values and vectors in signal processing
Abstract
In various applications it is necessary to keep track of a low-rank approximation of a covariance matrix, R(t), slowly varying with time. It is convenient to track the left singular vectors associated with the largest singular values of the triangular factor, L(t), of its Cholesky factorization. These algorithms are referred to as square-root. The drawback of the eigenvalue decomposition (EVD) or the singular value decompositions (SVD) is usually the volume of the computations. Various numerical methods for carrying out this task are surveyed, and it is shown why this heavy computational burden is questionable in numerous situations and should be revised. Indeed, the complexity per eigenpair is generally a quadratic function of the problem size, but there exist faster algorithms with linear complexity. Finally, in order to make a choice among the large and fuzzy set of available techniques, comparisons based on computer simulations in a relevant signal processing context are made.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Zienkiewicz, O. C. (1989) · Cited by 14,802
Multiple emitter location and signal parameter estimation
Schmidt, R. (1986) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1986.1143830 · Cited by 14,718
ESPRIT-estimation of signal parameters via rotational invariance techniques
Roy, R., & Kailath, T. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.32276 · Cited by 7,289
Detection, Estimation, And Modulation Theory
Trees, H. L. V. (1968) · Cited by 5,969
Principal component analysis in linear systems: Controllability, observability, and model reduction
Moore, B. (1981) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1981.1102568 · Cited by 5,282
The Symmetric Eigenvalue Problem
Parlett, B. N. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971163 · Cited by 3,192
Petroleum Reservoir Simulation
(2020) · Elsevier eBooks · doi:10.1016/c2018-0-04535-1 · Cited by 3,012
Bellanger, M. (1987) · Signal Processing · doi:10.1016/0165-1684(87)90147-2 · Cited by 2,961
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Self-citationAlexander, S. T. (1986) · Springer eBooks · doi:10.1007/978-1-4612-4978-8 · Cited by 2,646
Cited by
Two decades of array signal processing research: the parametric approach
Krim, H., & Viberg, M. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.526899 · Cited by 4,719
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
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898346995 · Cited by 1,567
Projection approximation subspace tracking
Yang, B. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.365290 · Cited by 1,273
Principal components, minor components, and linear neural networks
Oja, E. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80089-9 · Cited by 814
Blind multiuser detection: a subspace approach
Wang, X., & Poor, H. V. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661512 · Cited by 737
Channel estimation for wireless ofdm systems
Ozdemir, M., & Arslan, H. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.382406 · Cited by 641
Tensor decompositions, alternating least squares and other tales
Comon, P., Luciani, X., & de Almeida, A. L. F. (2009) · Journal of Chemometrics · doi:10.1002/cem.1236 · Cited by 457
Self-citationOptimization algorithms exploiting unitary constraints
Manton, J. H. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/78.984753 · Cited by 457
Riemannian Geometry of Grassmann Manifolds with a View on Algorithmic Computation
Absil, P.-A., Mahony, R., & Sepulchre, R. (2004) · Acta Applicandae Mathematica · doi:10.1023/b:acap.0000013855.14971.91 · Cited by 393
Blind equalization and multiuser detection in dispersive CDMA channels
Wang, X., & Poor, H. V. (1998) · IEEE Transactions on Communications · doi:10.1109/26.655407 · Cited by 391
Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
Baglama, J., & Reichel, L. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/04060593x · Cited by 334
Online identification and tracking of subspaces from highly incomplete information
Balzano, L., Nowak, R., & Recht, B. (2010) · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2010.5706976 · Cited by 331
Metadata
- Authors
- Comon, P., & Golub, G. H.
- Venue
- Proceedings of the IEEE
- Published
- 1990
- Volume
- 78
- Issue
- 8
- Pages
- 1327-1343
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2133884101
- Cited by
- 489
- References
- 36
- FWCI
- 11.22
- 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.