The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A randomized algorithm for the decomposition of matrices
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
Savitzky-Golay Smoothing Filters
Press, W. H., & Teukolsky, S. A. (1990) · Computers in Physics · doi:10.1063/1.4822961 · Cited by 11,670
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
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
Improved Approximation Algorithms for Large Matrices via Random Projections
Sarlos, T. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.37 · Cited by 646
Latent Semantic Indexing: A Probabilistic Analysis
Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1711 · Cited by 556
A theory of pseudoskeleton approximations
Goreinov, S. A., Tyrtyshnikov, E. E., & Замарашкин, Н. Л. (1997) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(96)00301-1 · Cited by 498
Numerics of Gram-Schmidt orthogonalization
Björck, Å. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90493-6 · Cited by 320
On the Compression of Low Rank Matrices
Cheng, H., Gimbutas, Z., Martinsson, P. G., & Rokhlin, V. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030602678 · Cited by 301
Self-citationA Randomized Algorithm for the Approximation of Matrices
Martinsson, P.-G., Rockhlin, V., & Tygert, M. (2006) · doi:10.21236/ada458932 · Cited by 268
Self-citationIncomplete Cross Approximation in the Mosaic-Skeleton Method
Tyrtyshnikov, E. (2000) · Computing · doi:10.1007/s006070070031 · Cited by 249
Some Applications of the Rank Revealing QR Factorization
Chan, T. F.-C., & Hansen, P. C. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913043 · Cited by 158
On interpolation and integration in finite-dimensional spaces of bounded functions
Martinsson, P., Rokhlin, V., & Tygert, M. (2006) · Communications in Applied Mathematics and Computational Science · doi:10.2140/camcos.2006.1.133 · Cited by 20
Self-citation
Cited by
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Self-citationMNE software for processing MEG and EEG data
Gramfort, A., Luessi, M., Larson, E., Engemann, D. A., Strohmeier, D., Brodbeck, C., Parkkonen, L., & Hämäläinen, M. S. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2013.10.027 · Cited by 1,951
Automated Machine Learning: Methods, Systems, Challenges
(2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5 · Cited by 1,485
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Automatic personality assessment through social media language.
Park, G., Schwartz, H. A., Eichstaedt, J. C., Kern, M. L., Kosinski, M., Stillwell, D. J., Ungar, L. H., & Seligman, M. E. P. (2015) · Journal of Personality and Social Psychology · doi:10.1037/pspp0000020 · Cited by 802
Metadata
- Authors
- Martinsson, P.-G., Rokhlin, V., & Tygert, M.
- Venue
- Applied and Computational Harmonic Analysis
- Publisher
- Elsevier BV
- Published
- 2011-01
- Volume
- 30
- Issue
- 1
- Pages
- 47-68
- ISSN
- 1063-5203 (ISSN-L)
- OpenAlex
- W2057261601
- Cited by
- 352
- References
- 15
- FWCI
- 10.69
- 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.