The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A Randomized Algorithm for the Approximation of Matrices
Abstract
Abstract. Given an m×n matrix A and a positive integer k, we describe a randomized procedure for the approximation of A with a matrix Z of rank k. The procedure relies on applying A T to a collection of l random vectors, where l is an integer equal to or slightly greater than k; the scheme is efficient whenever A and A T can be applied rapidly to arbitrary vectors. The discrepancy between A and Z is of the same order as √ lm times the (k + 1) st greatest singular value σk+1 of A, with negligible probability of even moderately large deviations. The actual estimates derived in the paper are fairly complicated, but are simpler when l − k is a fixed small nonnegative integer. For example, according to one of our estimates for l − k = 20, the probability that the spectral norm �A − Z � is greater than 10 p (k + 20) m σk+1 is less than 10 −17. The paper contains a number of estimates for �A − Z�, including several that are stronger (but more detailed) than the preceding example; some of the estimates are effectively independent of m. Thus, given a matrix A of limited numerical rank, such that both A and A T can be applied rapidly to arbitrary vectors, the scheme provides a simple, efficient means for constructing an accurate approximation to a singular value decomposition of A. Furthermore, the algorithm presented here operates reliably independently of the structure of the matrix A. The results are illustrated via several numerical examples.
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
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
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
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
Quick Approximation to Matrices and Applications
Frieze, A., & Kannan, R. (1999) · Combinatorica · doi:10.1007/s004930050052 · Cited by 502
Fast monte-carlo algorithms for finding low-rank approximations
Frieze, A., Kannan, R., & Vempala, S. (2004) · Journal of the ACM · doi:10.1145/1039488.1039494 · Cited by 500
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
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442684 · Cited by 487
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Ailon, N., & Chazelle, B. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132597 · Cited by 379
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-citationFast computation of low-rank matrix approximations
Achlioptas, D., & Mcsherry, F. (2007) · Journal of the ACM · doi:10.1145/1219092.1219097 · Cited by 292
Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
Kuczyński, J., & Woźniakowski, H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613066 · Cited by 251
Incomplete Cross Approximation in the Mosaic-Skeleton Method
Tyrtyshnikov, E. (2000) · Computing · doi:10.1007/s006070070031 · Cited by 249
Efficient computation of the DFT with only a subset of input or output points
Sorensen, H. V., & Burrus, C. S. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.205723 · Cited by 245
Estimating Extremal Eigenvalues and Condition Numbers of Matrices
Dixon, J. D. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720053 · Cited by 106
Checking approximate computations over the reals
Ar, S., Blum, M., Codenotti, B., & Gemmell, P. S. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167288 · Cited by 40
Cited by
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Self-citationFast Direct Methods for Gaussian Processes
Ambikasaran, S., Foreman-Mackey, D., Greengard, L., Hogg, D. W., & O'Neil, M. (2016) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2448083 · Cited by 669
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
Randomized algorithms for the low-rank approximation of matrices
Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709640104 · Cited by 559
Self-citation
Metadata
- Authors
- Martinsson, P.-G., Rockhlin, V., & Tygert, M.
- Publisher
- Defense Technical Information Center
- Published
- 2006-06-29
- OpenAlex
- W2152356156
- Cited by
- 268
- References
- 20
- Type
- report
- 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.