The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Fast low-rank modifications of the thin singular value decomposition
Open accessOverview
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
MIRSKY, L. (1960) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/11.1.50 · Cited by 611
An updating algorithm for subspace tracking
Stewart, G. W. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.139256 · Cited by 326
Updating the singular value decomposition
Bunch, J. R., & Nielsen, C. P. (1978) · Numerische Mathematik · doi:10.1007/bf01397471 · Cited by 283
An Eigenspace Update Algorithm for Image Analysis
Chandrasekaran, S., Manjunath, B. S., Wang, Y. F., Winkeler, J., & Zhang, H. (1997) · Graphical Models and Image Processing · doi:10.1006/gmip.1997.0425 · Cited by 233
Fast online SVD revisions for lightweight recommender systems
Brand, M. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.4 · Cited by 178
Self-citationComputational Methods for Intelligent Information Access
Berry, M. W., Dumais, S., & Letsche, T. A. (1995) · Proceedings - Supercomputing · doi:10.1145/224170.285569 · Cited by 128
Downdating the Singular Value Decomposition
Gu, M., & Eisenstat, S. C. (1995) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479893251472 · Cited by 57
Cited by
Software Framework for Topic Modelling with Large Corpora
Rek, R. R. U., & Sojka, P. (2010) · doi:10.13140/2.1.2393.1847 · Cited by 3,647
From Frequency to Meaning: Vector Space Models of Semantics
Turney, P. D., & Pantel, P. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2934 · Cited by 2,866
Frequency Selective Hybrid Precoding for Limited Feedback Millimeter Wave Systems
Alkhateeb, A., & Heath, R. W. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2549517 · Cited by 543
Nonlinear model order reduction based on local reduced‐order bases
Amsallem, D., Zahr, M. J., & Farhat, C. (2012) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.4371 · Cited by 501
dyngraph2vec: Capturing network dynamics using dynamic graph representation learning
Goyal, P., Chhetri, S. R., & Canedo, A. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.06.024 · Cited by 465
Millimeter Wave MIMO With Lens Antenna Array: A New Path Division Multiplexing Paradigm
Zeng, Y., & Zhang, R. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2533490 · Cited by 356
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., & Poupart, P. (2019) · arXiv · doi:10.48550/arxiv.1905.11485 · Cited by 338
Wolf, L., Hassner, T., & Taigman, Y. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.230 · Cited by 333
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
Similarity Scores Based on Background Samples
Wolf, L., Hassner, T., & Taigman, Y. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-12304-7_9 · Cited by 279
Robust Visual Tracking Via Consistent Low-Rank Sparse Learning
Zhang, T., Liu, S., Ahuja, N., Yang, M.-H., & Ghanem, B. (2015) · International Journal of Computer Vision · doi:10.1007/s11263-014-0738-0 · Cited by 256
An efficient edge artificial intelligence multipedestrian tracking method with rank constraint
Yang, H., Wen, J., Wu, X., He, L., & Mumtaz, S. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2897128 · Cited by 38
Metadata
- Authors
- Brand, M.
- Venue
- Linear Algebra and its Applications
- Publisher
- Elsevier BV
- Published
- 2006-05
- Volume
- 415
- Issue
- 1
- Pages
- 20-30
- ISSN
- 0024-3795 (ISSN-L)
- OpenAlex
- W2154249783
- Cited by
- 491
- References
- 8
- FWCI
- 2.51
- Type
- journal article
- Language
- en
- Open access
- bronze
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.