The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
An updating algorithm for subspace tracking
Abstract
In certain signal processing applications it is required to compute the null space of a matrix whose rows are samples of a signal with p components. The usual tool for doing this is the singular value decomposition. However, the singular value decomposition has the drawback that it requires O(p/sup 3/) operations to recompute when a new sample arrives. It is shown that a different decomposition, called the URV decomposition, is equally effective in exhibiting the null space and can be updated in O(p/sup 2/) time. The updating technique can be run on a linear array of p processors in O(p) time.>
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
Cites
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
Jacob, M. (1989) · Health Education Journal · doi:10.1177/001789698904800401 · Cited by 3,090
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Self-citationRank revealing QR factorizations
Chan, T. F. (1987) · Linear Algebra and its Applications · doi:10.1016/0024-3795(87)90103-0 · Cited by 521
Updating the singular value decomposition
Bunch, J. R., & Nielsen, C. P. (1978) · Numerische Mathematik · doi:10.1007/bf01397471 · Cited by 283
A Survey of Condition Number Estimation for Triangular Matrices
Higham, N. J. (1987) · SIAM Review · doi:10.1137/1029112 · Cited by 180
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
Disturbance detection and isolation by dynamic principal component analysis
Ku, W., Storer, R. H., & Georgakis, C. (1995) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(95)00076-3 · Cited by 1,483
Projection approximation subspace tracking
Yang, B. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.365290 · Cited by 1,273
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
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Gu, M., & Eisenstat, S. C. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917055 · Cited by 677
Metadata
- Authors
- Stewart, G. W.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1992-06
- Volume
- 40
- Issue
- 6
- Pages
- 1535-1541
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2141244461
- Cited by
- 326
- References
- 6
- FWCI
- 23.73
- 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.