W. Hackbusch, A sparse matrix arithmetic based on hmatrices. part i: Introduction to h-matrices, Computing, vol.62, issue.2, pp.89-108, 1999.

L. Grasedyck and W. Hackbusch, Construction and arithmetics of hmatrices, Computing, vol.70, issue.4, pp.295-334, 2003.

W. Hackbusch, Hierarchical Matrices: Algorithms and Analysis, 2015.

P. Amestoy, C. Ashcraft, O. Boiteau, A. Buttari, J. Y. L'excellent et al., Improving multifrontal methods by means of block lowrank 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, E. Darve, M. Faverge, P. Ramet, and J. Roman, Sparse supernodal solver using block low-rank compression: Design, performance and analysis, Journal of computational science, vol.27, pp.255-270, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01660665

A. Ida, Lattice h-matrices on distributed-memory systems, Proceedings of the International Parallel and Distributed Processing Symposium, pp.389-398, 2018.

I. Yamazaki, A. Ida, R. Yokota, and J. Dongarra, Distributed-memory lattice h-matrix factorization, The International Journal of High Performance Computing Applications, vol.33, pp.1046-1063, 2019.

, Hmat-oss library github repository

B. Lizé, Résolution directe rapide pour leséléments finis de frontière e? electromagnétisme et acoustique: H-Matrices, Parallélisme et applications industrielles.École doctorale Galilée, 2014.

E. Agullo, C. Augonnet, J. Dongarra, H. Ltaief, R. Namyst et al., Faster, cheaper, better a hybridization methodology to develop linear algebra software for gpus, CEA/DAM ; Total E&P
URL : https://hal.archives-ouvertes.fr/inria-00547847

E. Agullo, O. Aumage, M. Faverge, N. Furmento, F. Pruvost et al., Achieving high performance on supercomputers with a sequential task-based programming model, CEA/DAM ; Total E&P
URL : https://hal.archives-ouvertes.fr/hal-01618526

, The openmp api specification for parallel programming home page

R. Hoque, T. Herault, G. Bosilca, and J. Dongarra, Dynamic task discovery in parsec: A data-flow task-based runtime, Proceedings of the 8th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, pp.1-8, 2017.

, Starpu runtime system home page

C. Augonnet, S. Thibault, R. Namyst, and P. Wacrenier, Starpu: a unified platform for task scheduling on heterogeneous multicore architectures, Concurrency and Computation: Practice and Experience, vol.23, issue.2, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

A. Yarkhan, J. Kurzak, and J. Dongarra, Quark users guide, vol.268, 2011.

G. Golub and C. V. Loan, Matrix Computations, 1996.

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

P. Martinsson and J. Tropp, Randomized numerical linear algebra: Foundations & algorithms, 2020.

E. A. , LAPACK Users guide. SIAM, 1999.

M. Izadi, Hierarchical matrix techniques on massively parallel computers, 2012.

R. Kriemann, H-lu factorization on many-core systems, Computing and Vis. in Science, vol.16, issue.3, pp.105-117, 2013.

J. I. Aliaga, R. Carratalá-sáez, R. Kriemann, and E. S. Quintana-ortí, Task-parallel lu factorization of hierarchical matrices using ompss, 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp.290-294, 2017.

A. Ida, T. Iwashita, T. Mifune, and Y. Takahashi, Parallel hierarchical matrices with adaptive cross approximation on symmetric multiprocessing clusters, Journal of Information Processing, vol.22, issue.4, pp.642-650, 2014.

, H2lib library home page

S. Boerm, S. Christophersen, and R. Kriemann, Semiautomatic task graph construction for h-matrix arithmetic, 2019.

C. Augonnet, D. Goudin, M. Kuhn, X. Lacoste, R. Namyst et al., A hierarchical fast direct solver for distributed memory machines with manycore nodes, 2019.
URL : https://hal.archives-ouvertes.fr/cea-02304706

R. Carratalá-sáez, S. Christophersen, J. I. Aliaga, V. Beltran, S. Boerm et al., Exploiting nested task-parallelism in the h-lu factorization, Journal of Computational Science, vol.33, pp.20-33, 2019.

J. M. Perez, V. Beltran, J. Labarta, and E. Ayguadé, Improving the integration of task nesting and dependencies in openmp, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.809-818, 2017.

H. Cheng, Z. Gimbutas, P. G. Martinsson, and V. Rokhlin, On the compression of low rank matrices, SIAM Journal on Scientific Computing, vol.26, issue.4, pp.1389-1404, 2005.

A. Gillman, Fast direct solvers for elliptic partial differential equations, 2011.

A. Gillman, P. Young, and P. G. Martinsson, A direct solver with o(n) complexity for integral equations on one-dimensional domains, Frontiers of Mathematics in China, vol.7, issue.2, pp.217-247, 2012.

P. Amestoy, A. Buttari, J. Excellent, and T. Mary, Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel blr format, SIAM Journal on Scientific Computing, vol.41, issue.3, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01774642

, TEST FEMBEM library github repository

P. Plafrim-home,