M. Bebendorf, Approximation of boundary element matrices, Numerische Mathematik, vol.86, issue.4, pp.565-589, 2000.
DOI : 10.1007/PL00005410

C. Bischof, A Parallel QR Factorization Algorithm with Controlled Local Pivoting, SIAM Journal on Scientific and Statistical Computing, vol.12, issue.1, 1991.
DOI : 10.1137/0912002

C. Boutsidis, M. Mahoney, and P. Drineas, An Improved Approximation Algorithm for the Column Subset Selection Problem, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.968-977, 2009.
DOI : 10.1137/1.9781611973068.105

A. Çivril and M. Magdon-ismail, Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix, Algorithmica, vol.27, issue.3, pp.159-176, 2013.
DOI : 10.1137/S0097539795280895

J. W. Demmel, L. Grigori, M. Gu, and H. Xiang, Communication avoiding rank revealing QR factorization with column pivoting, SIAM J. Matrix Anal. Appl, 2015.
DOI : 10.21236/ada584728
URL : https://hal.archives-ouvertes.fr/hal-01112914

Z. Drma? and Z. Bujanovi?, On the Failure of Rank-Revealing QR Factorization Software -- A Case Study, ACM Transactions on Mathematical Software, vol.35, issue.2, pp.1-1228, 2008.
DOI : 10.1145/1377612.1377616

Z. Drma? and K. Veseli?, New Fast and Accurate Jacobi SVD Algorithm. I, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.4, pp.1322-1342, 2008.
DOI : 10.1137/050639193

Z. Drma? and K. Veseli?, New Fast and Accurate Jacobi SVD Algorithm. II, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.4, pp.1343-1362, 2008.
DOI : 10.1137/05063920X

J. Duersch and M. Gu, Randomized QR with Column Pivoting, SIAM Journal on Scientific Computing, vol.39, issue.4, pp.263-291, 2017.
DOI : 10.1137/15M1044680

G. Eckart and Y. G. , The approximation of one matrix by another of lower rank, Psychometrika, vol.1, issue.3, pp.211-218, 1936.
DOI : 10.1007/BF02288367

A. Edelman, Eigenvalues and Condition Numbers of Random Matrices, SIAM Journal on Matrix Analysis and Applications, vol.9, issue.4, pp.543-560, 1988.
DOI : 10.1137/0609045

W. Fong and E. Darve, The black-box fast multipole method, Journal of Computational Physics, vol.228, issue.23, pp.8712-8725, 2009.
DOI : 10.1016/j.jcp.2009.08.031

A. Frieze, R. Kannan, and S. Vempala, Fast monte-carlo algorithms for finding low-rank approximations, Journal of the ACM, vol.51, issue.6, pp.1025-1041, 2004.
DOI : 10.1145/1039488.1039494
URL : http://www-static.cc.gatech.edu/~vempala/papers/fastev.ps

G. Golub, V. Klema, and S. G. , Rank degeneracy and least squares problems, 1976.

S. Goreinov and E. Tyrtyshnikov, The maximal-volume concept in approximation by low-rank matrices, Contemporary Mathematics, issue.280, pp.47-51, 2001.
DOI : 10.1090/conm/280/4620

L. Grigori, S. Cayrols, and J. W. , Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting, SIAM Journal on Scientific Computing, vol.40, issue.2, 2016.
DOI : 10.1137/16M1074527
URL : https://hal.archives-ouvertes.fr/hal-01313856

M. Gu, Subspace Iteration Randomization and Singular Value Problems, SIAM Journal on Scientific Computing, vol.37, issue.3, 2015.
DOI : 10.1137/130938700
URL : http://arxiv.org/pdf/1408.2208

M. Gu and S. Eisenstat, Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization, SIAM Journal on Scientific Computing, vol.17, issue.4, pp.848-869, 1996.
DOI : 10.1137/0917055

N. Halko, P. G. Martinsson, and J. A. Tropp, Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions, SIAM Review, vol.53, issue.2, pp.217-288, 2011.
DOI : 10.1137/090771806

P. Hansen, Regularization tools version 4.1 for matlab 7.3, 2018.
DOI : 10.1007/s11075-007-9136-9
URL : http://orbit.dtu.dk/en/publications/regularization-tools-version-30-for-matlab-52(fd870e5d-bdaa-40f9-928a-e7a52339cdfd).html

R. Horn and C. Johnson, Topics in Matrix Analysis, 1991.
DOI : 10.1017/CBO9780511840371

A. Householder, Unitary Triangularization of a Nonsymmetric Matrix, Journal of the ACM, vol.5, issue.4, pp.339-342, 1958.
DOI : 10.1145/320941.320947
URL : https://hal.archives-ouvertes.fr/hal-01316095

D. Huckaby and C. T. , Stewart's pivoted QLP decomposition for low-rank matrices, Numerical Linear Algebra with Applications, vol.16, issue.2-3, pp.153-159, 2005.
DOI : 10.1137/1.9781611971408

W. Kahan, Numerical linear algebra, Bulletin canadien de math??matiques, vol.9, issue.0, pp.757-801, 1966.
DOI : 10.4153/CMB-1966-083-2

R. Larsen, Lanczos bidiagonalization with partial reorthogonalization Also available online from http: //soi, 1998.

I. Markovsky and S. Van-huffel, Overview of total least-squares methods. Signal Process, pp.2283-2302, 2007.

P. Martinsson, Randomized methods for matrix computations and analysis of high dimensional data, 2016.

P. Martinsson, V. Rokhlin, and M. Tygert, A randomized algorithm for the approximation of matrices, 2006.

L. Mirsky, SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS, The Quarterly Journal of Mathematics, vol.11, issue.1, pp.50-59, 1960.
DOI : 10.1093/qmath/11.1.50

S. O-'rourke, V. Vu, and K. Wang, Eigenvectors of random matrices: A survey, Journal of Combinatorial Theory, Series A, vol.144, pp.361-442, 2016.
DOI : 10.1016/j.jcta.2016.06.008

N. A. Ozdemir and J. Lee, A Low-Rank IE-QR Algorithm for Matrix Compression in Volume Integral Equations, IEEE Transactions on Magnetics, vol.40, issue.2, pp.1017-1020, 2004.
DOI : 10.1109/TMAG.2004.824575

C. Pan, On the existence and computation of rank-revealing LU factorizations, Linear Algebra and its Applications, vol.316, issue.1-3, pp.199-222, 2000.
DOI : 10.1016/S0024-3795(00)00120-8

C. Pan and P. Tang, Bounds on singular values revealed by QR factorizations, BIT Numerical Mathematics, vol.39, issue.4, pp.740-756, 1999.
DOI : 10.1016/B978-044482107-2/50014-5

M. Rudelson, Invertibility of random matrices: norm of the inverse, Annals of Mathematics, vol.168, issue.2, pp.575-600, 2008.
DOI : 10.4007/annals.2008.168.575

P. Schneider and D. Eberly, Geometric Tools for Computer Graphics, 2003.

G. W. Stewart, The QLP Approximation to the Singular Value Decomposition, SIAM Journal on Scientific Computing, vol.20, issue.4, pp.1336-1348, 1999.
DOI : 10.1137/S1064827597319519

S. Szarek, Condition numbers of random matrices, Journal of Complexity, vol.7, issue.2, pp.131-149, 1991.
DOI : 10.1016/0885-064X(91)90002-F

T. Tao and V. Vu, RANDOM MATRICES: UNIVERSAL PROPERTIES OF EIGENVECTORS, Random Matrices: Theory and Applications, vol.69, issue.01, p.1150001, 2012.
DOI : 10.1007/s00220-010-1044-5

S. Voronin and P. Martinsson, RSVDPACK: An implementation of randomized algorithms for computing the singular value, interpolative, and CUR decompositions of matrices on multi-core and GPU architectures, 2015.