E. Agullo, L. Giraud, A. Guermouche, and J. Roman, Parallel hierarchical hybrid linear solvers for emerging computing platforms, Comptes Rendus M??canique, vol.339, issue.2-3, pp.96-103, 2011.
DOI : 10.1016/j.crme.2010.11.005

URL : https://hal.archives-ouvertes.fr/inria-00548916

A. Aminfar, S. Ambikasaran, and E. Darve, A fast block low-rank dense solver with applications to finite-element matrices, Journal of Computational Physics, vol.304, pp.170-188, 2016.
DOI : 10.1016/j.jcp.2015.10.012

O. Axelsson and P. S. Vassilevski, Algebraic multilevel preconditioning methods. I, Numerische Mathematik, pp.157-177, 1989.

O. Axelsson and P. S. Vassilevski, Algebraic Multilevel Preconditioning Methods, II, SIAM Journal on Numerical Analysis, vol.27, issue.6, pp.27-1569, 1990.
DOI : 10.1137/0727092

M. Bebendorf, Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems, 2008.

M. Bebendorf, M. Bollhöfer, and M. Bratsch, Hierarchical matrix approximation with blockwise constraints, BIT Numerical Mathematics, vol.78, issue.1???2, pp.311-339, 2013.
DOI : 10.1007/s002110050307

M. Bebendorf, M. Bollhöfer, and M. Bratsch, On the spectral equivalence of hierarchical matrix preconditioners for elliptic problems, Mathematics of Computation, vol.85, issue.302, pp.2839-2861, 2016.
DOI : 10.1090/mcom/3086

S. Chandrasekaran, M. Gu, and T. Pals, A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations, SIAM Journal on Matrix Analysis and Applications, vol.28, issue.3, pp.603-622, 2006.
DOI : 10.1137/S0895479803436652

C. Chevalier and F. Pellegrini, PT-Scotch: A tool for efficient parallel graph ordering, Parallel Matrix Algorithms and Applications, pp.318-331, 2008.
DOI : 10.1016/j.parco.2007.12.001

URL : https://hal.archives-ouvertes.fr/hal-00410427

T. A. Davis and Y. Hu, The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-1, 2011.
DOI : 10.1145/2049662.2049663

URL : http://www.cise.ufl.edu/submit/files/file_298.pdf

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

L. Elsner, A note on optimal block-scaling of matrices, Numerische Mathematik, vol.44, issue.1, pp.127-128, 1984.
DOI : 10.1007/BF01389760

URL : https://pub.uni-bielefeld.de/download/1774912/2311674/Elsner_034.pdf

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

J. Gaidamour and P. Hénon, A Parallel Direct/Iterative Solver Based on a Schur Complement Approach, 2008 11th IEEE International Conference on Computational Science and Engineering, pp.98-105, 2008.
DOI : 10.1109/CSE.2008.36

URL : https://hal.archives-ouvertes.fr/hal-00353589

L. Giraud, A. Haidar, and L. Watson, Parallel scalability study of hybrid preconditioners in three dimensions, Parallel Matrix Algorithms and Applications, pp.363-379, 2008.
DOI : 10.1016/j.parco.2008.01.006

G. H. Golub and C. F. Loan, Matrix computations, Forth Edition, 17] L. Grasedyck and W. Hackbusch, Construction and Arithmetics of H-Matrices, pp.295-334, 2003.

M. Gu and S. C. 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

URL : https://zenodo.org/record/1236138/files/article.pdf

W. Hackbusch, A Sparse Matrix Arithmetic Based on H-Matrices. Part I: Introduction to H-Matrices, Computing, pp.62-89, 1999.
DOI : 10.1007/s006070050015

W. Hackbusch and B. N. Khoromskij, A Sparse H-Matrix Arithmetic. Part II: Application to Multi-Dimensional Problems, Computing, pp.64-85, 2000.
DOI : 10.1016/s0377-0427(00)00486-6

URL : https://doi.org/10.1016/s0377-0427(00)00486-6

P. Hénon, P. Ramet, and J. Roman, PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems, Parallel Computing, vol.28, issue.2, pp.301-321, 2002.
DOI : 10.1016/S0167-8191(01)00141-7

M. R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, Journal of Research of the National Bureau of Standards, p.49, 1952.
DOI : 10.6028/jres.049.044

URL : http://doi.org/10.6028/jres.049.044

P. Jolivet, F. Hecht, F. Nataf, and C. , Prud'homme, Scalable Domain Decomposition Preconditioners for Heterogeneous Elliptic Problems, Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, SC '13, pp.1-8011
DOI : 10.1145/2503210.2503212

X. S. Li, M. Shao, I. Yamazaki, and E. G. Ng, Factorization-based sparse solvers and preconditioners, Journal of Physics: Conference Series, vol.180, p.12015, 2009.
DOI : 10.1088/1742-6596/180/1/012015

URL : http://iopscience.iop.org/article/10.1088/1742-6596/180/1/012015/pdf

E. Liberty, F. Woolfe, P. Martinsson, V. Rokhlin, and M. Tygert, Randomized algorithms for the low-rank approximation of matrices, Proceedings of the National Academy of Sciences, pp.20167-20172, 2007.
DOI : 10.1137/0613066

P. G. Martinsson, A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix, SIAM Journal on Matrix Analysis and Applications, vol.32, issue.4, pp.1251-1274, 2011.
DOI : 10.1137/100786617

L. Miranian and M. Gu, Strong rank revealing LU factorizations, Linear Algebra and its Applications, vol.367, pp.1-16, 2003.
DOI : 10.1016/S0024-3795(02)00572-4

B. Parlett, The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics, 1998.
DOI : 10.1137/1.9781611971163

S. Rajamanickam, E. G. Boman, and M. A. Heroux, ShyLU: A Hybrid-Hybrid Solver for Multicore Platforms, 2012 IEEE 26th International Parallel and Distributed Processing Symposium, pp.631-643
DOI : 10.1109/IPDPS.2012.64

S. Rjasanow, Adaptive cross approximation of dense matrices, Int. Association Boundary Element Methods Conf., IABEM, pp.28-30, 2002.

Y. Saad, Iterative Methods for Sparse Linear Systems, 2003.
DOI : 10.1137/1.9780898718003

, Scilab: Free and Open Source software for numerical computation, Scilab Enterprises, Scilab Enterprises, 2012.

A. J. Wathen, A. Preconditioning, and . Numerica, , pp.329-376, 2015.

, Inria

F. Woolfe, E. Liberty, V. Rokhlin, and M. Tygert, A fast randomized algorithm for the approximation of matrices, Applied and Computational Harmonic Analysis, vol.25, issue.3, pp.25-335, 2008.
DOI : 10.1016/j.acha.2007.12.002

J. Xia, S. Chandrasekaran, M. Gu, and X. S. Li, Fast algorithms for hierarchically semiseparable matrices, Numerical Linear Algebra with Applications, pp.953-976, 2010.

J. Xia and M. Gu, Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices, SIAM Journal on Matrix Analysis and Applications, vol.31, issue.5, pp.31-2899, 2010.
DOI : 10.1137/090750500

J. Xia and Z. Xin, Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization, SIAM Journal on Matrix Analysis and Applications, vol.38, issue.4, pp.1298-1322, 2017.
DOI : 10.1137/17M1124152

K. Yang, H. Pouransari, and E. Darve, Sparse Hierarchical Solvers with Guaranteed Convergence, ArXiv e-prints, 2016.

S. Zampini, PCBDDC: A Class of Robust Dual-Primal Methods in PETSc, SIAM Journal on Scientific Computing, vol.38, issue.5, pp.282-306, 2016.
DOI : 10.1137/15M1025785