Rectangular maximum volume and projective volume search algorithms

M. Gu, S. C. Eisenstat, efficient algorithms for computing a strong rank-revealing qr factorization // SIAM J. ScI. COMPUT. — 1996. — Vol. 17, no. 4. — P. 848-869

1996

Earlier work this paper cites.

C.-T. Pan, On the existence and computation of rank revealing LU factorizations // Linear Algebra and its Applications — 2000. — Vol. 316. — P. 199–222

2000

Earlier work this paper cites.

M. Bebendorf. Approximation of boundary element matrices // Numerische Mathematic. — 2000. — Vol. 86. — P. 565–589

2000

Earlier work this paper cites.

Goreinov S.A., Tyrtyshnikov E.E. The maximal-volume concept in approximation by low-rank matrices // Contemporary Mathematics. — 2001. — Vol. 268. — P. 47–51

2001

Earlier work this paper cites.

A. Deshpande and S. Vempala. Adaptive sampling and fast low-rank matrix approximation // Approximation, randomization and combinatorial optimization — 2006. — Vol. 4110 of LNCS, Springer, Berlin. — P. 292–303

2006

Earlier work this paper cites.

A. Deshpande, L. Rademacher et al. Matrix Approximation and Projective Clustering via Volume Sampling // Theory of Computing. — 2006. — Vol. 2. — P. 225–247

Original

2006

Earlier work this paper cites.

Ali Çivril, Malik Magdon-Ismail. On selecting a maximum volume sub-matrix of a matrix and related problems // Theoretical Computer Science. — 2009. — Vol. 410, no. 47-49. — P. 4801–4811

2009

Cited alongside, same era.

How to find a good submatrix / S.A. Goreinov, I.V. Oseledets, D.V. Savostyanov et al. // Matrix Methods: Theory, Algorithms, Applications / Ed. by V. Olshevsky, E. Tyrtyshnikov. — World Scientific Publishing, 2010. — P. 247-256

2010

Cited alongside, same era.

Goreinov S.A., Tyrtyshnikov E.E. Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm // Doklady Mathematics. — 2011. — Vol. 83, no. 3. — P. 1–2

2011

Cited alongside, same era.

H. Avron and C. Boutsidis. Faster Subset Selection for Matrices and Applications // SIAM J. Matrix Anal. Appl . — 2011. — Vol. 34, no. 4

2011

Cited alongside, same era.

S. Matveev, A.P. Smirnov, E. E. Tyrtyshnikov. A fast numerical method for the Cauchy problem for the Smoluchowski equation // Journal of Computational Physics — 2014. — Vol. 282, no. FEB. — P. 23–32

2014

Later among the works it cites.

C. Boutsidis and D. P. Woodruff. Optimal cur matrix decompositions // Proceedings of the 46th Annual ACM Symposium on Theory of Computing, ACM. — 2014 — P. 353–362

2014

Later among the works it cites.

Mikhalev A.Y., Oseledets I.V. Rectangular submatrices of maximum volume and their computation // Doklady Mathematics — 2015. — Vol. 91, no. 3. — P. 267-268

2015

Later among the works it cites.

A.I. Osinsky, N.L. Zamarashkin. Pseudo-skeleton approximations with better accuracy estimates // Linear Algebra and its Applications — 2018. — Vol. 537. — P. 221-249

2018

Closest in time.