Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
Top Cited Papers
- 7 August 2023
- journal article
- research article
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 49 (4) , 1-29
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Directorate for Mathematical and Physical Sciences (1952735, 2012606)
- U.S. Department of Energy (DE-SC0022251)
- Office of Naval Research (N00014-18-1-2354)
This publication has 51 references indexed in Scilit:
- Exponential Inapproximability of Selecting a Maximum Volume Sub-matrixAlgorithmica, 2011
- CUR matrix decompositions for improved data analysisProceedings of the National Academy of Sciences, 2009
- A fast randomized algorithm for overdetermined linear least-squares regressionProceedings of the National Academy of Sciences, 2008
- Invertibility of random matrices: norm of the inverseAnnals of Mathematics, 2008
- Randomized algorithms for the low-rank approximation of matricesProceedings of the National Academy of Sciences, 2007
- The Adaptive Cross Approximation Algorithm for Accelerated Method of Moments Computations of EMC ProblemsIEEE Transactions on Electromagnetic Compatibility, 2005
- Incomplete Cross Approximation in the Mosaic-Skeleton MethodComputing, 2000
- On the stability of Gauss-Jordan elimination with pivotingCommunications of the ACM, 1975
- Numerical Linear AlgebraCanadian Mathematical Bulletin, 1966
- Unitary Triangularization of a Nonsymmetric MatrixJournal of the ACM, 1958