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 101–200 of 541
Clark, E., Brunton, S. L., & Kutz, J. N. (2020) · IEEE Sensors Journal · doi:10.1109/jsen.2020.3013094 · Cited by 56
Hybrid reduced order modeling applied to nonlinear models
Bang, Y., Abdel‐Khalik, H. S., & Hite, J. M. (2012) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.4298 · Cited by 60
Randomized Local Model Order Reduction
Buhr, A., & Smetana, K. (2018) · SIAM Journal on Scientific Computing · doi:10.1137/17m1138480 · Cited by 50
Source Code to "Randomized Local Model Order Reduction", arXiv:1706.09179
Buhr, A. (2017) · Figshare · doi:10.5281/zenodo.820953 · Cited by 46
Large-scale stochastic linear inversion using hierarchical matrices
Ambikasaran, S., Li, J. Y., Kitanidis, P. K., & Darve, E. (2013) · Computational Geosciences · doi:10.1007/s10596-013-9364-0 · Cited by 45
A Fast Direct Solver for High Frequency Scattering from a Large Cavity in Two Dimensions
Lai, J., Ambikasaran, S., & Greengard, L. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/140964904 · Cited by 45
A Fast Algorithm for Fourier Continuation
Lyon, M. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/11082436x · Cited by 44
Randomized approximate nearest neighbors algorithm
Jones, P. W., Osipov, A., & Rokhlin, V. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1107769108 · Cited by 55
Self-citationScalable Gaussian Process Computations Using Hierarchical Matrices
Geoga, C. J., Anitescu, M., & Stein, M. L. (2019) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2019.1652616 · Cited by 51
Square-root variable metric based elastic full-waveform inversion—Part 2: uncertainty estimation
Liu, Q., & Peter, D. (2019) · Geophysical Journal International · doi:10.1093/gji/ggz137 · Cited by 42
Dense Fast Random Projections and Lean Walsh Transforms
Liberty, E., Ailon, N., & Singer, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85363-3_40 · Cited by 52
Self-citationMatrix probing: A randomized preconditioner for the wave-equation Hessian
Demanet, L., Létourneau, P.-D., Boumal, N., Calandra, H., Chiu, J., & Snelson, S. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2011.03.006 · Cited by 41
Dimensionality Reduction of Massive Sparse Datasets Using CoresetsPreprint
Feldman, D., Volkov, M., & Rus, D. L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.01663 · Cited by 41
ASKIT: Approximate Skeletonization Kernel-Independent Treecode in High Dimensions
March, W. B., Xiao, B., & Biros, G. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/140989546 · Cited by 55
A two-stage algorithm for extracting the multiscale backbone of complex weighted networks
Slater, P. B. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0904725106 · Cited by 40
De‐aliased and de‐noise Cadzow filtering for seismic data reconstruction
Huang, W., Feng, D., & Chen, Y. (2019) · Geophysical Prospecting · doi:10.1111/1365-2478.12867 · Cited by 39
Vatankhah, S., Ardestani, V. E., & Renaut, R. A. (2014) · Journal of Geophysics and Engineering · doi:10.1088/1742-2132/11/4/045001 · Cited by 39
A Randomized Approximate Nearest Neighbors Algorithm
Jones, P. W., Osipov, A., & Rokhlin, V. (2010) · Defense Technical Information Center (DTIC) · doi:10.21236/ada555156 · Cited by 39
Self-citationBlock low-rank multifrontal solvers : complexity, performance, and scalability
Mary, T. (2017) · doi:10.70675/64f94edcz1308z4555zacd8zb0be6c9dec27 · Cited by 39
Online principal components analysis
Boutsidis, C., Garber, D., Karnin, Z. S., & Liberty, E. (2016) · Cited by 38
Self-citationRobust tensor-completion algorithm for 5D seismic-data reconstruction
Carozzi, F., & Sacchi, M. D. (2018) · Geophysics · doi:10.1190/geo2018-0109.1 · Cited by 38
Cheng, J., Sacchi, M. D., & Gao, J. (2018) · Geophysics · doi:10.1190/geo2018-0343.1 · Cited by 38
Singular Value Decomposition (SVD)
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.002 · Cited by 74
Fast Multilevel Computation of Low-Rank Representation of ${\mathcal{ H}}$ -Matrix Blocks
Brick, Y., & Yılmaz, A. E. (2016) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2016.2617376 · Cited by 37
How to Reduce Dimension With PCA and Random Projections?
Yang, F., Liu, S., Dobriban, E., & Woodruff, D. P. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3112821 · Cited by 39
Sensor Selection With Cost Constraints for Dynamically Relevant Bases
Clark, E., Kutz, J. N., & Brunton, S. L. (2020) · IEEE Sensors Journal · doi:10.1109/jsen.2020.2997298 · Cited by 36
Lorenz, R., Davin, É. L., & Seneviratne, S. I. (2012) · Journal of Geophysical Research Atmospheres · doi:10.1029/2012jd017755 · Cited by 38
Kink-antikink asymmetry and impurity interactions in topological mechanical chains
Zhou, Y., Chen, B. G., Upadhyaya, N., & Vitelli, V. (2017) · Physical review. E · doi:10.1103/physreve.95.022202 · Cited by 37
International Journal INFORMATION THEORIES & APPLICATIONS
Тимофеев, А. В., Vanhoof, K., Волошин, А. Д., Eremeev, A., Aslanyan, L. H., Kleshchev, A., López, L. F. D. M., Palagin, A. V., Mintchev, M. P., Milani, A., et al. (2009) · Cited by 35
Dong, Y., & Martinsson, P. (2023) · Advances in Computational Mathematics · doi:10.1007/s10444-023-10061-z · Cited by 34
Self-citationrandUTV: A Blocked Randomized Algorithm for Computing a Rank-Revealing UTV Factorization
Martinsson, P., Quintana‐Ortí, G., & Heavner, N. (2019) · ACM Transactions on Mathematical Software · doi:10.1145/3242670 · Cited by 37
Self-citationSparse approximate inverse preconditioner for multiscale dynamic electromagnetic problems
Pan, X., & Sheng, X. (2014) · Radio Science · doi:10.1002/2014rs005387 · Cited by 33
Bousserez, N., & Henze, D. K. (2017) · Quarterly Journal of the Royal Meteorological Society · doi:10.1002/qj.3209 · Cited by 36
A randomized SVD for Multichannel Singular Spectrum Analysis (MSSA) noise attenuation
Oropeza, V. E., & Sacchi, M. D. (2010) · Second International Meeting for Applied Geoscience & Energy · doi:10.1190/1.3513584 · Cited by 33
Bach, C., Ceglia, D., Song, L., & Duddeck, F. M. E. (2018) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.6009 · Cited by 42
Subset Selection Algorithms: Randomized vs. Deterministic
Broadbent, M., Brown, M., & Penner, K. (2010) · SIAM Undergraduate Research Online · doi:10.1137/09s010435 · Cited by 32
“Some discussion of these algorithms can be found in [13, 15, 7].”
BackgroundAmbikasaran, S., Borges, C. F., Imbert‐Gérard, L., & Greengard, L. (2016) · SIAM Journal on Scientific Computing · doi:10.1137/15m102455x · Cited by 32
Randomized model order reduction
Alla, A., & Kutz, J. N. (2019) · Advances in Computational Mathematics · doi:10.1007/s10444-018-09655-9 · Cited by 32
libdlr: Efficient imaginary time calculations using the discrete Lehmann representation
Kaye, J., Chen, K., & Strand, H. U. R. (2022) · Computer Physics Communications · doi:10.1016/j.cpc.2022.108458 · Cited by 32
Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems
Spantini, A., Cui, T., Willcox, K. E., Tenorio, L., & Marzouk, Y. (2017) · SIAM Journal on Scientific Computing · doi:10.1137/16m1082123 · Cited by 41
Online Adaptive Asymmetric Active Learning With Limited Budgets
Zhang, Y., Zhao, P., Niu, S., Wu, Q., Cao, J., Huang, J., & Tan, M. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2955078 · Cited by 32
Predicting run time of classification algorithms using meta-learning
Doan, T., & Kalita, J. (2016) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-016-0571-6 · Cited by 30
Function Approximation on Arbitrary Domains Using Fourier Extension Frames
Matthysen, R., & Huybrechs, D. (2018) · SIAM Journal on Numerical Analysis · doi:10.1137/17m1134809 · Cited by 30
Filtering and parameter estimation of surface-NMR data using singular spectrum analysis
Ghanati, R., Hafizi, M. K., Mahmoudvand, R., & Fallahsafari, M. (2016) · Journal of Applied Geophysics · doi:10.1016/j.jappgeo.2016.04.005 · Cited by 29
Direct Solution of Scattering Problems Using Generalized Source Integral Equations
Sharshevsky, A., Brick, Y., & Boag, A. (2020) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2020.2975549 · Cited by 29
Low-Rank Matrix Factorization Method for Multiscale Simulations: A Review
Li, M., Ding, D., Heldring, A., Hu, J. X., Chen, R., & Vecchi, G. (2021) · IEEE Open Journal of Antennas and Propagation · doi:10.1109/ojap.2021.3061936 · Cited by 29
A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
Schmitz, P. G., & Lexing Ying, B. (2013) · Journal of Computational Physics · doi:10.1016/j.jcp.2013.10.030 · Cited by 29
Water and growth: An econometric analysis of climate and policy impacts
Khan, H. F., Morzuch, B. J., & Brown, C. (2017) · Water Resources Research · doi:10.1002/2016wr020054 · Cited by 32
A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
Higham, N. J., & Mary, T. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m1182802 · Cited by 29
Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD
Batselier, K., Yu, W., Daniel, L., & Wong, N. (2018) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/17m1140480 · Cited by 29
A fast direct boundary element method for 3D acoustic problems based on hierarchical matrices
Li, R., Liu, Y.-J., & Ye, W. (2023) · Engineering analysis with boundary elements · doi:10.1016/j.enganabound.2022.11.035 · Cited by 25
Li, L., Wang, Y., You, Z., Li, Y., & An, J. (2018) · International Journal of Molecular Sciences · doi:10.3390/ijms19041029 · Cited by 28
Leveraging Uncertainty Quantification to Design Ocean Climate Observing Systems
Loose, N., & Heimbach, P. (2021) · Journal of Advances in Modeling Earth Systems · doi:10.1029/2020ms002386 · Cited by 28
PySensors: A Python package for sparse sensor placement
de Silva, B. M., Manohar, K., Clark, E., Brunton, B. W., Kutz, J. N., & Brunton, S. L. (2021) · The Journal of Open Source Software · doi:10.21105/joss.02828 · Cited by 35
Slevinsky, R. M. (2017) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2017.11.001 · Cited by 31
Yeh, C.-N., & Morales, M. A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00615 · Cited by 40
A fast SVD for multilevel block Hankel matrices with minimal memory storage
Lu, L., Xu, W., & Qiao, S. (2014) · Numerical Algorithms · doi:10.1007/s11075-014-9930-0 · Cited by 27
Gong, M., Jiang, X., & Li, H. (2017) · Frontiers of Computer Science · doi:10.1007/s11704-016-5552-0 · Cited by 29
Geometry-oblivious FMM for compressing dense SPD matrices
Yu, C. D., Levitt, J., Reiz, S., & Biros, G. (2017) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3126908.3126921 · Cited by 27
An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
Cambier, L., Chen, C., Boman, E. G., Rajamanickam, S., Tuminaro, R. S., & Darve, E. (2020) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/19m123806x · Cited by 27
A new fast direct solver for the boundary element method
Huang, S., & Liu, Y.-J. (2017) · Computational Mechanics · doi:10.1007/s00466-017-1407-2 · Cited by 23
Cui, Z., Gao, Y.-L., Liu, J., Dai, L.-Y., & Yuan, S. (2019) · BMC Bioinformatics · doi:10.1186/s12859-019-2768-7 · Cited by 31
Qin, X., Hu, W., & Yang, J. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00927 · Cited by 26
Improved Practical Matrix Sketching with Guarantees
Desai, A., Ghashami, M., & Phillips, J. M. (2016) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2539943 · Cited by 26
OpenMendel: a cooperative programming project for statistical genetics
Zhou, H., Sinsheimer, J. S., Bates, D. M., Chu, B. B., German, C., Ji, S. S., Keys, K. L., Kim, J., Ko, S., Mosher, G., et al. (2019) · Human Genetics · doi:10.1007/s00439-019-02001-z · Cited by 34
A parallel hierarchical blocked adaptive cross approximation algorithm
Liu, Y., Sid-Lakhdar, W. M., Rebrova, E., Ghysels, P., & Li, X. S. (2020) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342020918305 · Cited by 26
Butterfly Factorization Via Randomized Matrix-Vector Multiplications
Liu, Y., Xing, X., Guo, H., Michielssen, E., Ghysels, P., & Li, X. S. (2021) · SIAM Journal on Scientific Computing · doi:10.1137/20m1315853 · Cited by 25
Efficient methods for computing observation impact in 4D-Var data assimilation
Cioaca, A., Sandu, A., & de Sturler, E. (2013) · Computational Geosciences · doi:10.1007/s10596-013-9370-2 · Cited by 25
Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra
Lim, L., & Weare, J. (2017) · SIAM Review · doi:10.1137/15m1040827 · Cited by 25
Efficient Frequent Directions Algorithm for Sparse Matrices
Ghashami, M., Liberty, E., & Phillips, J. M. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939800 · Cited by 25
Self-citationChaillat, S., & Biros, G. (2012) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.02.006 · Cited by 24
Randomized interpolative decomposition of separated representations
Biagioni, D., Beylkin, D., & Beylkin, G. (2014) · Journal of Computational Physics · doi:10.1016/j.jcp.2014.10.009 · Cited by 24
Ma, H., Wang, L., Wan, L., Li, J., Qin, X., Liu, J., Hu, W., Lin, L., Yang, C., & Yang, J. (2021) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.1c03762 · Cited by 24
Column Selection via Adaptive SamplingPreprint
Paul, S., Magdon‐Ismail, M., & Petros Drineas, B. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.04149 · Cited by 24
Fast multipole preconditioners for sparse matrices arising from elliptic equations
Ibeid, H., Yokota, R., Pestana, J., & Keyes, D. E. (2017) · Computing and Visualization in Science · doi:10.1007/s00791-017-0287-5 · Cited by 23
Efficient truncated randomized SVD for mesh-free kernel methodsImage 1
Noorizadegan, A., Chen, C., Cavoretto, R., & Rossi, A. D. (2024) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2024.03.021 · Cited by 23
Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems
Liu, X., Xia, J., & de Hoop, M. V. (2016) · SIAM Journal on Scientific Computing · doi:10.1137/15m1023774 · Cited by 23
A Fast Randomized Algorithm for Overdetermined Linear Least-Squares Regression
Rokhlin, V., & Tygert, M. (2008) · doi:10.21236/ada489855 · Cited by 23
Self-citationPass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views
Bjarkason, E. K. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m118966x · Cited by 22
On dimension reduction in Gaussian filters
Solonen, A., Cui, T., Hakkarainen, J., & Marzouk, Y. (2016) · Inverse Problems · doi:10.1088/0266-5611/32/4/045003 · Cited by 26
Ji, H., Yu, W., & Li, Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.08134 · Cited by 22
Non-Adversarial Unsupervised Word TranslationPreprint
Hoshen, Y., & Wolf, L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1801.06126 · Cited by 27
Fast approximate computations with Cauchy matrices and polynomials
Pan, V. (2017) · Mathematics of Computation · doi:10.1090/mcom/3204 · Cited by 21
“For efficient alternative techniques, some of which use randomization or heuristics, see [GOS08], [GT01], [HMT11], [LWMRT], [M11], [M11a], [PQY15], [T00], [W14], [XXG12], and the references therein.”
MethodPan, X., Huang, S.-L., & Sheng, X. (2018) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2018.2794404 · Cited by 21
A fast time domain solver for the equilibrium Dyson equation
Kaye, J., & Strand, H. U. R. (2023) · Advances in Computational Mathematics · doi:10.1007/s10444-023-10067-7 · Cited by 24
Fast Multipole Method as a Matrix-Free Hierarchical Low-Rank Approximation
Yokota, R., Ibeid, H., & Keyes, D. E. (2017) · Lecture notes in computational science and engineering · doi:10.1007/978-3-319-62426-6_17 · Cited by 21
A fast integral equation method for the two-dimensional Navier-Stokes equations
af Klinteberg, L., Askham, T., & Kropinski, M. C. A. (2020) · Journal of Computational Physics · doi:10.1016/j.jcp.2020.109353 · Cited by 24
REDUCED ORDER MODELING FOR NONLINEAR MULTI-COMPONENT MODELS
Abdel‐Khalik, H. S., Bang, Y., Kennedy, C., & Hite, J. M. (2012) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2012003523 · Cited by 21
Block Basis Factorization for Scalable Kernel Evaluation
Wang, R., Li, Y., Mahoney, M. W., & Darve, E. (2019) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/18m1212586 · Cited by 21
An Iterative Closest Point Method for Unsupervised Word Translation.Preprint
Hoshen, Y., & Wolf, L. (2018) · arXiv (Cornell University) · Cited by 21
Rapid Rank Estimation and Low-Rank Approximation of Impedance Matrix Blocks Using Proxy Grids
Brick, Y., & Yılmaz, A. E. (2018) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2018.2854361 · Cited by 20
New Efficient and Robust HSS Cholesky Factorization of SPD Matrices
Li, S., Gu, M., Wu, C. J., & Xia, J. (2012) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110851110 · Cited by 20
Approximation error in regularized SVD-based Fourier continuations
Lyon, M. (2012) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2012.06.032 · Cited by 20
Multidimensional butterfly factorization
Li, Y., Yang, H., & Lexing Ying, B. (2017) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2017.04.002 · Cited by 20
Accurate and Efficient Evaluation of Spatial Electromagnetic Responses of Large Scale Targets
Pan, X., & Sheng, X. (2014) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2014.2334356 · Cited by 20
Post-buckling behaviour of a growing elastic rod
Almet, A. A., Byrne, H. M., Maini, P. K., & Moulton, D. E. (2018) · Journal of Mathematical Biology · doi:10.1007/s00285-018-1292-0 · Cited by 24
Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
Duersch, J. A., & Gu, M. (2020) · SIAM Review · doi:10.1137/20m1335571 · Cited by 25
Extreme Compressive Sampling for Covariance Estimation
Azizyan, M., Krishnamurthy, A., & Singh, A. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2871077 · Cited by 20
Cipolla, S., & Gondzio, J. (2022) · EURO Journal on Computational Optimization · doi:10.1016/j.ejco.2022.100046 · Cited by 19
Improved Algebraic Preconditioning for MoM Solutions of Large-Scale Electromagnetic Problems
Pan, X., & Sheng, X. (2014) · IEEE Antennas and Wireless Propagation Letters · doi:10.1109/lawp.2013.2295239 · Cited by 19
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.