P. R. Amestoy, C. Ashcraft, O. Boiteau, A. Buttari, J. Excellent et al., Improving Multifrontal Methods by Means of Block Low-Rank Representations, SIAM Journal on Scientific Computing, vol.37, issue.3, pp.1451-1474, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00776859

T. Mary, Block Low-Rank multifrontal solvers: complexity, performance, and scalability, 2017.
URL : https://hal.archives-ouvertes.fr/tel-01708791

G. Pichon, On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques, 2018.
URL : https://hal.archives-ouvertes.fr/tel-01953908

W. Hackbusch, A Sparse Matrix Arithmetic Based on H-Matrices. Part I: Introduction to H-Matrices, Computing, vol.62, issue.2, pp.89-108, 1999.

W. Hackbusch and S. Börm, Data-sparse Approximation by Adaptive H 2 -Matrices, Computing, vol.69, issue.1, pp.1-35, 2002.

P. Ghysels, X. S. Li, C. Gorman, and F. Rouet, A robust parallel preconditioner for indefinite systems using hierarchical matrices and randomized sampling, IEEE IPDPS, pp.897-906, 2017.

A. Aminfar and E. Darve, A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finiteelement matrices, International Journal for Numerical Methods in Engineering, vol.107, issue.6, pp.520-540, 2016.

T. A. Davis, R. Sivasankaran, and W. M. Sid-lakhdar, A survey of direct methods for sparse linear systems, Acta Numerica, vol.25, pp.383-566, 2016.

A. George, Nested dissection of a regular finite element mesh, SIAM Journal on Numerical Analysis, vol.10, issue.2, pp.345-363, 1973.

G. Karypis and V. Kumar, METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, 1995.

F. Pellegrini, Scotch and libScotch 5.1 User's Guide, vol.127, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00410332

J. J. Dongarra, J. Croz, S. Hammarling, and I. S. Duff, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Softw, vol.16, issue.1, pp.1-17, 1990.

P. Hénon, P. Ramet, and J. Roman, PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems, Parallel Computing, vol.28, issue.2, pp.301-321, 2002.

J. N. Chadwick and D. S. Bindel, An Efficient Solver for Sparse Linear Systems Based on Rank-Structured Cholesky Factorization, CoRR, 2015.

J. E. Savage, Models of computation -exploring the power of computing, 1998.

L. , Memory and data aware scheduling, 2018.

H. Kellerer, U. Pferschy, and D. Pisinger, Multidimensional knapsack problems," in Knapsack problems, pp.235-283, 2004.

E. Tardos, Introduction to approximation and online algorithms, 2016.

S. Ubaru and Y. Saad, Fast methods for estimating the numerical rank of large matrices, ICML, pp.468-477, 2016.

L. Stanisic, E. Agullo, A. Buttari, A. Guermouche, A. Legrand et al., Fast and accurate simulation of multithreaded sparse linear algebra solvers, IEEE ICPADS, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01180272

T. A. Davis and Y. Hu, The University of Florida sparse matrix collection, ACM Trans. Math. Softw, vol.38, issue.1, 2011.

M. Sergent, D. Goudin, S. Thibault, and O. Aumage, Controlling the Memory Subscription of Distributed Applications with a Task-Based Runtime System, HIPS, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01284004

, Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria