Randomized algorithms for the low-rank approximation of matrices
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application ( inter alia ) to the evaluation of the singular value decompositions of numerically low-rank matrices. Being probabilistic, the schemes described here have a finite probability of failure; in most cases, this probability is rather negligible (10 −17 is a typical value). In many situations, the new procedures are considerably more efficient and reliable than the classical (deterministic) ones; they also parallelize naturally. We present several numerical examples to illustrate the performance of the schemes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Björck, Å., Dahlquist, G. G., & Anderson, N. (1974) · Cited by 1,719
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
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 fast randomized algorithm for the approximation of matrices
Woolfe, F., Liberty, E., Rokhlin, V., & Tygert, M. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.12.002 · Cited by 280
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-citationEstimating 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
Research works printed but not linked: 1
- N Ailon B Chazelle (ACM Press New York) pp. 557–563 (2006).
Cited by
Items 301–400 of 541
Discrete Lehmann representation of three-point functions
Kiese, D., Strand, H. U. R., Chen, K., Wentzell, N., Parcollet, O., & Kaye, J. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.035135 · Cited by 8
Liu, J., Chen, Y., He, M., Yuan, J., & Li, Z. (2022) · IEEE Antennas and Wireless Propagation Letters · doi:10.1109/lawp.2022.3180480 · Cited by 8
Efficient pseudomode representation and complexity of quantum impurity models
Thoenniss, J., Vilkoviskiy, I., & Abanin, D. A. (2025) · Physical review. B./Physical review. B · doi:10.1103/h8g7-bmng · Cited by 21
Parallel Implementation of Fast Randomized Algorithms for Low Rank Matrix Decomposition
Lucas, A., Stalzer, M., & Feo, J. (2014) · Parallel Processing Letters · doi:10.1142/s0129626414500042 · Cited by 8
Collective excitability in a mesoscopic neuronal model of epileptic activity
Jedynak, M., Pons, A. J., & García‐Ojalvo, J. (2018) · Physical review. E · doi:10.1103/physreve.97.012204 · Cited by 8
Fast Randomized Singular Value Decomposition-Based Clutter Filtering for Shear Wave Imaging
Wang, Y., He, Q., & Luo, J. (2020) · IEEE Transactions on Ultrasonics Ferroelectrics and Frequency Control · doi:10.1109/tuffc.2020.3005426 · Cited by 8
Agullo, E., Darve, E., Giraud, L., & Harness, Y. (2018) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/17m1151158 · Cited by 8
Li, W., Xu, S., & Shao, M. (2019) · Engineering Analysis with Boundary Elements · doi:10.1016/j.enganabound.2019.06.020 · Cited by 8
Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
Xia, J. (2021) · SIAM Journal on Scientific Computing · doi:10.1137/20m1349540 · Cited by 8
A Fast Frequent Directions Algorithm for Low Rank Approximation
Teng, D., & Chu, D. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2839198 · Cited by 8
Continuous matrix approximation on distributed data
Ghashami, M., Phillips, J. M., & Li, F. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2732951.2732954 · Cited by 7
Sun, F.-L., & Dong, C.-Y. (2023) · Engineering analysis with boundary elements · doi:10.1016/j.enganabound.2023.07.038 · Cited by 5
Sparsity and Compressed Sensing
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.004 · Cited by 9
Nonlinear Model Reduction for Slow–Fast Stochastic Systems Near Unknown Invariant Manifolds
Ye, F. X.-F., Yang, S., & Maggioni, M. (2023) · Journal of Nonlinear Science · doi:10.1007/s00332-023-09998-8 · Cited by 7
Lu, J., & Yang, H. (2017) · Journal of Computational Physics · doi:10.1016/j.jcp.2017.03.055 · Cited by 7
Bringing High Performance Computing to Big Data Algorithms
Anzt, H., Dongarra, J. J., Gates, M., Jakub Kurzak, A., Łuszczek, P., Tomov, S. Z., & Yamazaki, I. (2017) · Springer eBooks · doi:10.1007/978-3-319-49340-4_23 · Cited by 7
Liu, Y., Pan, X., & Sheng, X. (2019) · International Journal of Numerical Modelling Electronic Networks Devices and Fields · doi:10.1002/jnm.2667 · Cited by 7
Embarrassingly shallow auto-encoders for dynamic collaborative filtering
Jeunen, O., Balen, J. V., & Goethals, B. (2022) · User Modeling and User-Adapted Interaction · doi:10.1007/s11257-021-09314-7 · Cited by 7
Bach, C., Duddeck, F. M. E., & Song, L. (2019) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.6068 · Cited by 7
Residual Based Sampling for Online Low Rank Approximation
Bhaskara, A., Lattanzi, S., Vassilvitskii, S., & Zadimoghaddam, M. (2019) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2019.00094 · Cited by 7
Adaptive Randomized Dimension Reduction on Massive DataPreprint
Darnell, G., Georgiev, S., Mukherjee, S., & Engelhardt, B. E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.03183 · Cited by 8
Takahashi, H., & Borrelli, R. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01728 · Cited by 7
A systematic review of low-rank and local low-rank matrix approximation in big data medical imaging
Hamlomo, S., Atemkeng, M., Brima, Y., Nunhokee, C. D., & Baxter, J. (2025) · Neural Computing and Applications · doi:10.1007/s00521-025-11055-2 · Cited by 15
Gao, H.-W., Hao, J.-W., Pan, X., & Sheng, X. (2014) · IEEE Antennas and Wireless Propagation Letters · doi:10.1109/lawp.2014.2341592 · Cited by 6
Bassu, D., Jones, P. W., Ness, L. A., & Shallcross, D. (2020) · Forum of Mathematics Sigma · doi:10.1017/fms.2020.40 · Cited by 6
Robust Grid-Based Computation of H-Matrix Blocks’ Low-Rank Approximation for Vector Basis Functions
Kelley, J. T., Yılmaz, A. E., & Brick, Y. (2022) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2022.3209730 · Cited by 6
Xiao, C., & Yang, C. (2024) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2024.03.004 · Cited by 6
A Random Algorithm for Low-Rank Decomposition of Large-Scale Matrices With Missing Entries
Liu, Y., Lei, Y., Li, C., Xu, W., & Pu, Y. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2458176 · Cited by 6
A simple filter for detecting low-rank submatrices
Rangan, A. V. (2012) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.12.032 · Cited by 6
A fast direct solver for boundary value problems on locally perturbed geometries
Zhang, Y., & Gillman, A. (2017) · Journal of Computational Physics · doi:10.1016/j.jcp.2017.12.013 · Cited by 6
A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions
Xin, Z., Xia, J., de Hoop, M. V., Cauley, S., & Balakrishnan, V. (2017) · SIAM Journal on Scientific Computing · doi:10.1137/16m1079221 · Cited by 6
Task-parallel in situ temporal compression of large-scale computational fluid dynamics data
Pacella, H., Dunton, A. M., Doostan, A., & Iaccarino, G. (2022) · The International Journal of High Performance Computing Applications · doi:10.1177/10943420221085000 · Cited by 6
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.012 · Cited by 8
Tensor LU and QR decompositions and their randomized algorithms
Zhu, Y., & Wei, Y. (2022) · Computational Mathematics and Computer Modeling with Applications (CMCMA) · doi:10.52547/cmcma.1.1.1 · Cited by 6
Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme
Карлович, С. К. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-18466-6_2 · Cited by 6
Stochastic Boundary Methods of Fundamental Solutions for solving PDEs
Карлович, С. К. (2012) · Engineering Analysis with Boundary Elements · doi:10.1016/j.enganabound.2012.02.003 · Cited by 6
On spectral and numerical properties of random butterfly matrices
Trogdon, T. (2019) · Applied Mathematics Letters · doi:10.1016/j.aml.2019.03.024 · Cited by 6
Xin, Z., Xia, J., Cauley, S., & Balakrishnan, V. (2020) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2294 · Cited by 6
3-D and 5-D reconstruction ofPreceiver functions via multichannel singular spectrum analysis
Rubio, G., Chen, Y., Sacchi, M. D., & Gu, Y. J. (2020) · Geophysical Journal International · doi:10.1093/gji/ggaa541 · Cited by 6
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.009 · Cited by 8
Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning
Shabat, G., Choshen, E., Or, D. B., & Carmel, N. (2021) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/20m1343993 · Cited by 6
Intensity-Mosaic: automatic panorama mosaicking of disordered images with insufficient features
Gong, C., Brunton, S. L., Schowengerdt, B. T., & Seibel, E. J. (2021) · Journal of medical imaging · doi:10.1117/1.jmi.8.5.054002 · Cited by 6
An approximate empirical Bayesian method for large-scale linear-Gaussian inverse problemsPreprint
Zhou, Q., Liu, W., Li, J., & Marzouk, Y. (2018) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 6
Structured Block Basis Factorization for Scalable Kernel Matrix Evaluation.Preprint
Wang, R., Li, Y., Mahoney, M. W., & Darve, E. (2015) · arXiv (Cornell University) · Cited by 6
A power method for computing singular value decomposition
Dembélé, D. (2026) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2026.117451 · Cited by 5
Fast computation of two-dimensional spatial electromagnetic scattering from large-scale targets
Pan, X., & Sheng, X. (2013) · Computational Electromagnetics International Workshop (CEM) · doi:10.1109/cem.2013.6617110 · Cited by 5
Jacobson, M. Z., Howarth, R. W., Delucchi, M. A., Scobie, S. R., Barth, J. M., Dvorak, M. J., Klevze, M., Katkhuda, H., Miranda, B., Chowdhury, N. A., et al. (2013) · Energy Policy · doi:10.1016/j.enpol.2013.07.105 · Cited by 5
Seq-SVF: An unsupervised data-driven method for automatically identifying hidden governing equations
Wu, Z., Ye, H., Zhang, H., & Zheng, Y. (2023) · Computer Physics Communications · doi:10.1016/j.cpc.2023.108887 · Cited by 5
Taylor, P. A., & Stevens, M. J. (2023) · The European Physical Journal E · doi:10.1140/epje/s10189-023-00355-x · Cited by 5
A Preconditioning Approach for the Domain Decomposition Simulation of High-Speed Circuits
Lu, J. (2023) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2023.3332204 · Cited by 5
Nonlinear approximations for electronic structure calculations
Beylkin, G., & Haut, T. S. (2013) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2013.0231 · Cited by 5
Effective matrix-free preconditioning for the augmented immersed interface method
Xia, J., Zhilin Li, B., & Ye, X. (2015) · Journal of Computational Physics · doi:10.1016/j.jcp.2015.09.050 · Cited by 5
Linear-time Detection of Non-linear Changes in Massively High Dimensional Time Series
Nguyen, H. V., & Vreeken, J. (2016) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974348.93 · Cited by 5
Efficient MPI parallel interpolative decomposition
Huang, S.-L., Xu, H., Pan, X., & Sheng, X. (2016) · International Conference on Microwave and Millimeter Wave Technology (ICMMT) · doi:10.1109/icmmt.2016.7762450 · Cited by 5
New fast divide‐and‐conquer algorithms for the symmetric tridiagonal eigenvalue problem
Li, S., Liao, X., Liu, J., & Jiang, H. (2016) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2046 · Cited by 5
Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification
Greene, S. M., Webber, R. J., Berkelbach, T. C., & Weare, J. (2022) · SIAM Journal on Scientific Computing · doi:10.1137/21m1422513 · Cited by 5
A fast direct singular boundary method for three-dimensional potential problems
Li, W., & Wu, B. (2022) · Engineering Analysis with Boundary Elements · doi:10.1016/j.enganabound.2022.03.021 · Cited by 5
Lee, C. H., Kotulski, J. D., Dang, V., & Lee, J. (2023) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2022.3233426 · Cited by 5
Liu, W., & He, M. (2019) · IEEE Antennas and Wireless Propagation Letters · doi:10.1109/lawp.2019.2936242 · Cited by 5
Hybrid regularization for MRI reconstruction with static field inhomogeneity correction
Compton, R., Osher, S., & Bouchard, L. (2013) · Inverse Problems and Imaging · doi:10.3934/ipi.2013.7.1215 · Cited by 5
Matrix probing, skeleton decompositions, and sparse Fourier transform
Chiu, J. (2013) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5
An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank ApproximationPreprint
Anderson, D. G., & Gu, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.05950 · Cited by 10
Segmentation of Subspaces in Sequential DataPreprint
Tierney, S., Guo, Y., & Gao, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.04090 · Cited by 5
On the Adaptive Cross Approximation for the Magnetic Field Integral Equation
Tetzner, J. M., & Adrian, S. B. (2024) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2024.3483296 · Cited by 4
Efficient CUR decomposition for interpretable low-rank approximations and imaging applications
Abdelgawad, M. A. A., Cheung, R. C. C., & Yan, H. (2025) · Neurocomputing · doi:10.1016/j.neucom.2025.130401 · Cited by 4
A Low-Rank Direct Solver for Nonconformal Domain Decomposition Methods
Lu, J. (2024) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2024.3427003 · Cited by 4
Use of Multigrids to Reduce the Cost of Performing Interpolative Separable Density Fitting
Smyser, K. E., White, A. F., & Sharma, S. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c02431 · Cited by 4
Aarset, C. (2024) · Inverse Problems · doi:10.1088/1361-6420/add9bf · Cited by 9
Least Squares Approximation via Sparse Subsampled Randomized Hadamard Transform
Teng, D., Zhang, X., Cheng, L., & Chu, D. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2020.2972887 · Cited by 4
Fast and Robust Clutter Filtering in Ultrafast Echocardiography
Xu, Y., Yiu, K., & Lee, W.-N. (2022) · Ultrasound in Medicine & Biology · doi:10.1016/j.ultrasmedbio.2022.09.013 · Cited by 4
Enhanced image approximation using shifted rank-1 reconstruction
Boßmann, F., & Ma, J. (2020) · Inverse Problems and Imaging · doi:10.3934/ipi.2020012 · Cited by 4
Coarse-Grained Modeling of Protein Unfolding Dynamics
Deng, M., & Karniadakis, G. E. (2014) · Multiscale Modeling and Simulation · doi:10.1137/130921519 · Cited by 4
Fast structured LU factorization for nonsymmetric matrices
Li, S., Gu, M., & Cheng, L. (2013) · Numerische Mathematik · doi:10.1007/s00211-013-0582-0 · Cited by 4
Applications of Randomized Methods for Decomposing and Simulating from Large Covariance Matrices
Dehdari, V., & Deutsch, C. V. (2012) · Quantitative geology and geostatistics · doi:10.1007/978-94-007-4153-9_2 · Cited by 4
Randomization or Condensation?
Zhang, K., Liu, C., Zhang, J., Xiong, H., Xing, E. P., & Ye, J. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098050 · Cited by 4
Liu, Q. (2019) · Inverse Problems · doi:10.1088/1361-6420/ab1c33 · Cited by 4
A Bootstrap Method for Error Estimation in Randomized Matrix MultiplicationPreprint
Lopes, M. E., Wang, S., & Mahoney, M. W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.01945 · Cited by 4
Algorithm-Agnostic Low-Rank Approximation of Operator Monotone Matrix Functions
Persson, D., Meyer, R. A., & Musco, C. (2025) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/23m1619435 · Cited by 3
A Low-Rank Tensor Completion Algorithm for Electromagnetic Spectrum Based on SIDWT
Niu, Y., Fan, Y., Ma, S., Xu, Z., & Fang, S. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3582876 · Cited by 3
Bi-fidelity interpolative decomposition for multimodal data
Cutforth, M., Fan, T., Zahtila, T., Doostan, A., & Darve, E. (2026) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.118706 · Cited by 3
Yesypenko, A., & Martinsson, P. (2026) · Journal of Scientific Computing · doi:10.1007/s10915-025-03157-9 · Cited by 3
Self-citationLi, Z., Mo, T., Song, J., & Wang, B. (2024) · Geophysical Prospecting · doi:10.1111/1365-2478.13507 · Cited by 3
Low-rank diffraction separation using an improved MSSA algorithm
Lin, P., Zhao, J., & Peng, S. (2021) · Acta Geophysica · doi:10.1007/s11600-021-00642-1 · Cited by 3
Tensor tree decomposition as a rank‐reduction method for pre‐stack interpolation
Manenti, R. R., & Sacchi, M. D. (2023) · Geophysical Prospecting · doi:10.1111/1365-2478.13374 · Cited by 4
Generalized Matrix Local Low Rank Representation by Random Projection and Submatrix Propagation
Dang, P., Zhu, H., Guo, T., Wan, C., Zhao, T., Salama, P., Wang, Y., Cao, S., & Zhang, C. (2023) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3580305.3599361 · Cited by 3
Li, Z., Song, J., Lin, R., & Wang, B. (2024) · Surveys in Geophysics · doi:10.1007/s10712-024-09835-x · Cited by 3
Fast Updating Multipole Coulombic Potential Calculation
Höft, T. A., & Alpert, B. K. (2017) · SIAM Journal on Scientific Computing · doi:10.1137/16m1096189 · Cited by 3
GPT-Free Sensitivity Analysis for Monte Carlo Models
Wu, Z., Liang, J., Peng, X., & Abdel‐Khalik, H. S. (2019) · Nuclear Technology · doi:10.1080/00295450.2018.1556062 · Cited by 3
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.010 · Cited by 3
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.008 · Cited by 6
Single-pass randomized QLP decomposition for low-rank approximation
Ren, H., Xiao, G., & Bai, Z. (2022) · CALCOLO · doi:10.1007/s10092-022-00491-4 · Cited by 3
Detecting low-rank clusters via random sampling
Rangan, A. V. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.09.008 · Cited by 3
A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations
Lessel, K., Hartman, M., & Chandrasekaran, S. (2016) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/15m1028467 · Cited by 3
On Rapid Estimation of Impedance-Matrix Ranks via Grid-Based Techniques
Kelley, J. T., Brick, Y., & Yılmaz, A. E. (2018) · Digest - IEEE Antennas and Propagation Society. International Symposium · doi:10.1109/apusncursinrsm.2018.8608656 · Cited by 3
Scalable design methods for online data‐driven wide‐area control of power systems
Kar, J., & Chakrabortty, A. (2021) · IET Generation Transmission & Distribution · doi:10.1049/gtd2.12159 · Cited by 3
A cross-product approach for low-rank approximations of large matrices
Dax, A. (2019) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2019.112576 · Cited by 3
Block-Adaptive Cross Approximation of Discrete Integral Operators
Bauer, M., & Bebendorf, M. (2020) · Computational Methods in Applied Mathematics · doi:10.1515/cmam-2019-0085 · Cited by 3
Fast algorithm for robust subspace recovery.Preprint
Lerman, G., & Maunu, T. (2014) · arXiv (Cornell University) · Cited by 3
Randomized Dimension Reduction on Massive DataPreprint
Georgiev, S., & Mukherjee, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.1642 · Cited by 3
High-Performance Out-of-core Block Randomized Singular Value Decomposition on GPUPreprint
Lu, Y., Ino, F., & Matsushita, Y. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.07191 · Cited by 3
Metadata
- Authors
- Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M.
- Affiliations
- Yale University (US)
- University of Colorado Boulder (US)
- Department of Computer Science and
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2007-12-18
- Volume
- 104
- Issue
- 51
- Pages
- 20167-20172
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC2154402
- OpenAlex
- W1968691112
- Cited by
- 559
- References
- 14
- Citations by year
- 2026: 25 · 2025: 22 · 2024: 21 · 2023: 29 · 2022: 26 · 2021: 35 · 2020: 44 · 2019: 56 · 2018: 37 · 2017: 41 · 2016: 44 · 2015: 41 · 2014: 33 · 2013: 27 · 2012: 27
- FWCI
- 8.96
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- ePubWU Institutional Repository (Wirtschaftsuniversität Wien) (submittedVersion)
- WU Research (submittedVersion, other-oa)
- Funders
- Japan Society for the Promotion of Science (26820298, 25000003, 16H00923)
- National Institute of Environmental Health Sciences (27302C0031)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Mathematics › Applied Mathematics › Statistical and numerical algorithms
- Keywords
- low-rank approximation, randomized algorithms, singular value decomposition, parallel algorithms, matrix approximation
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.