S. Abdulah, H. Ltaief, Y. Sun, M. G. Genton, and D. E. Keyes, Tile lowrank approximation of large-scale maximum likelihood estimation on manycore architectures, 2018.

E. Agullo, P. R. Amestoy, A. Buttari, A. Guermouche, J. -y.-l'excellent et al., Robust memory-aware mappings for parallel multifrontal factorizations, SIAM Journal on Scientific Computing, vol.38, issue.3, pp.256-279, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01334113

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

E. Agullo, A. Buttari, A. Guermouche, and F. Lopez, Implementing multifrontal sparse solvers for multicore architectures with sequential task flow runtime systems, ACM Transactions on Mathematical Software (TOMS), vol.43, issue.2, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01333645

E. Agullo, L. Giraud, A. Guermouche, A. Haidar, and J. Roman, Parallel algebraic domain decomposition solver for the solution of augmented systems, Advances in Engineering Software, vol.60, pp.23-30, 2013.
URL : https://hal.archives-ouvertes.fr/inria-00559133

K. Akbudak, H. Ltaief, A. Mikhalev, and D. E. Keyes, Tile Low Rank Cholesky Factorization for Climate/Weather Modeling Applications on Manycore Architectures, pp.22-40, 2017.

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

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-01237169

P. R. Amestoy, A. Buttari, I. S. Duff, A. Guermouche, J. Y. L'excellent et al., Encyclopedia of Parallel Computing, pp.1232-1238, 2011.

P. R. ,

A. Amestoy, J. Buttari, T. Excellent, and . Mary, On the complexity of the block low-rank multifrontal factorization, SIAM Journal on Scientific Computing, vol.39, issue.4, pp.1710-1740, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01672943

P. R. Amestoy, A. Buttari, J. Excellent, and T. Mary, Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel BLR format, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01774642

P. R. Amestoy, T. A. Davis, and I. S. Duff, An approximate minimum degree ordering algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996.

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.

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.

E. Anderson, Z. Bai, C. Bischof, L. S. Blackford, J. W. Demmel et al., , 1992.

J. Anton, C. Ashcraft, and C. Weisbecker, A Block Low-Rank Multithreaded Factorization for Dense BEM Operators, SIAM Conference on Parallel Processing for Scientific Computing (SIAM PP 2016), 2016.

D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics), 2007.

C. Ashcraft and I. Duff, Maxflow, min-cuts and multisectors of graphs, CSC14: The Sixth SIAM Workshop on Combinatorial Scientific Computing, p.17, 2014.

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, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

R. Battiti and A. Bertossi, Differential greedy for the 0-1 equicut problem, Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location, pp.3-21, 1997.

M. Bebendorf, Hierarchical matrices, 2008.

J. T. Betts and W. P. Huffman, Mesh refinement in direct transcription methods for optimal control, Optimal Control Applications and Methods, vol.19, issue.1, pp.1-21, 1998.

L. S. Blackford, J. Choi, A. Cleary, E. D'azevedo, J. W. Demmel et al., ScaLAPACK users' guide. SIAM, 1997.

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, A. Haidar et al., Flexible development of dense linear algebra algorithms on massively parallel architectures with dplasma, Parallel and Distributed Processing Workshops and Phd Forum, pp.1432-1441, 2011.

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, T. Hérault et al., Dongarra. Parsec: Exploiting heterogeneity to enhance scalability, Computing in Science & Engineering, vol.15, issue.6, pp.36-45, 2013.

A. E. Caldwell, A. B. Kahng, A. A. Kennings, and I. L. Markov, Hypergraph partitioning for VLSI CAD: methodology for heuristic development, experimentation and reporting, Proceedings of the 36th annual ACM/IEEE Design Automation Conference, pp.349-354, 1999.

A. Casadei, P. Ramet, and J. Roman, An improved recursive graph bipartitioning algorithm for well balanced domain decomposition, 21st IEEE International Conference on High Performance Computing (HiPC), pp.1-10, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01056749

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

P. Charrier and J. Roman, Algorithmic study and complexity bounds for a nested dissection solver, Numerische Mathematik, vol.55, issue.4, pp.463-476, 1989.

Y. Chen, T. A. Davis, W. W. Hager, and S. Rajamanickam, Algorithm 887: Cholmod, supernodal sparse cholesky factorization and update/downdate, ACM Transactions on Mathematical Software (TOMS), vol.35, issue.3, p.22, 2008.

N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, DTIC Document, 1976.

P. Ciarlet and F. Lamour, On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint, Numerical Algorithms, vol.12, issue.1, pp.193-214, 1996.

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

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

J. J. Dongarra, J. Du-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.

J. Duersch and M. Gu, Randomized qr with column pivoting, SIAM Journal on Scientific Computing, vol.39, issue.4, pp.263-291, 2017.

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct methods for sparse matrices, 1986.

I. S. Duff and J. K. Reid, The multifrontal solution of indefinite sparse symmetric linear, ACM Transactions on Mathematical Software (TOMS), vol.9, issue.3, pp.302-325, 1983.

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

M. Faverge, Ordonnancement hybride statique-dynamique en algèbre linéaire creuse pour de grands clusters de machines NUMA et multi-coeurs. PhD thesis, LaBRI, 2009.

C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, Proceedings of the 19th design automation conference, pp.175-181, 1982.

J. Gaidamour and P. Hénon, A parallel direct/iterative solver based on a Schur complement approach, IEEE 11th International Conference on Computational Science and Engineering, pp.98-105, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00353547

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

A. George, M. T. Heath, J. W. Liu, and E. G. Ng, Sparse Cholesky factorization on a local memory multiprocessor, SIAM Journal on Scientific and Statistical Computing, vol.9, pp.327-340, 1988.

A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite Systems, 1981.

A. George and D. R. Mcintyre, On the application of the minimum degree algorithm to finite element systems, SIAM Journal on Numerical Analysis, vol.15, issue.1, pp.90-112, 1978.

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

P. Ghysels, X. S. Li, F. Rouet, S. Williams, and A. Napov, An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling, SIAM Journal on Scientific Computing, vol.38, issue.5, pp.358-384, 2016.

L. Giraud, A. Haidar, and Y. Saad, Sparse approximations of the Schur complement for parallel algebraic hybrid linear solvers in 3D. Rapport de recherche RR-7237, INRIA, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00542450

L. Giraud and J. Langou, A Robust Criterion for the Modified Gram-Schmidt Algorithm with Selective Reorthogonalization, SIAM Journal on Scientific Computing, vol.25, issue.2, pp.417-441, 2003.

L. Grasedyck, W. Hackbusch, and R. Kriemann, Performance of H-LU preconditioning for sparse matrices, Computational methods in applied mathematics, vol.8, issue.4, pp.336-349, 2008.

L. Grasedyck, R. Kriemann, and S. Le-borne, Parallel black box H-LU preconditioning for elliptic boundary value problems. Computing and Visualization in Science, vol.11, pp.273-291, 2008.

L. Grasedyck, R. Kriemann, and S. Le-borne, Domain decomposition based H ? lu preconditioning, Numerische Mathematik, vol.112, issue.4, pp.565-600, 2009.

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, Hierarchical Matrices: Algorithms and Analysis, vol.49, 2015.

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

N. Halko, P. Martinsson, and A. J. Tropp, Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, SIAM review, vol.53, pp.217-288, 2011.

R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.26, issue.2, pp.147-160, 1950.

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.

P. Hénon, P. Ramet, and J. Roman, On finding approximate supernodes for an efficient block-ILU (k) factorization, Parallel Computing, vol.34, issue.6-8, pp.345-362, 2008.

K. L. Ho and L. Ying, Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations, Communications on Pure and Applied Mathematics, vol.8, issue.69, pp.1415-1451, 2016.

T. Hofmann, B. Schölkopf, and A. J. Smola, Kernel methods in machine learning. The annals of statistics, pp.1171-1220, 2008.

K. D. Hogg, J. K. Reid, and J. A. Scott, Design of a multicore sparse Cholesky factorization using dags, SIAM Journal on Scientific Computing, vol.32, issue.6, pp.3627-3649, 2010.

G. W. Howell, J. W. Demmel, C. T. Fulton, S. Hammarling, and K. Marmol, Cache efficient bidiagonalization using blas 2.5 operators, ACM Trans. Math. Softw, vol.34, issue.3, p.33, 2008.

A. Ida, Lattice h-matrices on distributed-memory systems, 2018 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018, 2018.
DOI : 10.1109/ipdps.2018.00049

A. Ida, H. Nakashima, and M. Kawai, Parallel hierarchical matrices with block low-rank representation on distributed memory computer systems, Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region, pp.232-240, 2018.

M. Jacquelin, E. G. Ng, and W. B. Peyton, Fast and effective reordering of columns within supernodes using partition refinement, Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, pp.76-86, 2018.

S. Jain, C. Swamy, and K. Balaji, Greedy algorithms for k-way graph partitioning, the 6th international conference on advanced computing, 1998.

D. S. Johnson and L. A. Mcgeoch, The Traveling Salesman Problem: A Case Study in Local Optimization, vol.1, pp.215-310, 1997.

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

G. Karypis and V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.

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

J. Kurzak, P. Luszczek, A. Yarkhan, M. Faverge, J. Langou et al., Handbook of Multi and Many-Core Processing: Architecture, Algorithms, Programming, and Applications, 2014.

X. Lacoste, Scheduling and memory optimizations for sparse direct solver on multi-core/multi-gpu cluster systems, 2015.

X. Lacoste, C. Augonnet, and D. Goudin, Designing An Efficient and Scalable Block Low-Rank Direct Solver for Large Scale Clusters, SIAM Conference on Parallel Processing for Scientific Computing (SIAM PP 2016), 2016.

X. Lacoste, M. Faverge, P. Ramet, S. Thibault, and G. Bosilca, Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes, HCW'2014 workshop of IPDPS, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00925017

R. Leland and B. Hendrickson, A multilevel algorithm for partitioning graphs, ACM/IEEE conference on Supercomputing, 1995.

L. Li, S. Lanteri, and R. Perrussel, A hybridizable discontinuous galerkin method combined to a schwarz algorithm for the solution of 3d time-harmonic maxwell's equation, Journal of Computational Physics, vol.256, pp.563-581, 2014.

X. S. Li and J. W. Demmel, SuperLU_DIST: A Scalable Distributed-memory Sparse Direct Solver for Unsymmetric Linear Systems, ACM Trans. Math. Softw, vol.29, issue.2, pp.110-140, 2003.

R. J. Lipton, D. J. Rose, and R. E. Tarjan, Generalized nested dissection, SIAM journal on numerical analysis, vol.16, issue.2, pp.346-358, 1979.

R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM Journal on Applied Mathematics, vol.36, pp.177-189, 1979.

J. W. Liu, The role of elimination trees in sparse factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.134-172, 1990.

J. W. Liu, E. G. Ng, and B. W. Peyton, On finding supernodes for sparse matrix computations, SIAM Journal on Matrix Analysis and Applications, vol.14, issue.1, pp.242-252, 1993.

B. Lizé, Résolution directe rapide pour les éléments finis de frontière en électromagnétisme et acoustique : H-matrices. parallélisme et applications industrielles, 2014.

R. Luce and E. G. Ng, On the minimum flops problem in the sparse Cholesky factorization, SIAM Journal on Matrix Analysis and Applications, vol.35, issue.1, pp.1-21, 2014.

P. 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.

P. Martinsson, Blocked rank-revealing qr factorizations: How randomized sampling can be used to avoid single-vector pivoting, 2015.

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

G. L. Miller, S. Teng, and S. A. Vavasis, A unified geometric approach to graph separators, Proc. 31st Annual Symposium on Foundations of Computer Science, pp.538-547, 1991.

G. L. Miller and S. A. Vavasis, Density graphs and separators, Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.331-336, 1991.

. University-of-waterloo, Concorde TSP solver

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

A. Pothen and C. Fan, Computing the block triangular form of a sparse matrix, ACM Transactions on Mathematical Software (TOMS), vol.16, issue.4, pp.303-324, 1990.

H. Pouransari, P. Coulier, and E. Darve, Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation, SIAM Journal on Scientific Computing, vol.39, issue.3, pp.797-830, 2017.

M. Predari, Load Balancing for Parallel Coupled Simulations, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01518956

M. Predari, A. Esnard, and J. Roman, Comparison of initial partitioning methods for multilevel direct k-way graph partitioning with fixed vertices. Parallel Computing, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01538600

S. Rajamanickam, E. G. Boman, and M. A. Heroux, ShyLU : A hybrid-hybrid solver for multicore platforms, Parallel Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International, pp.631-643, 2012.

E. Rebrova, G. Chavez, Y. Liu, P. Ghysels, and X. S. Li, A study of clustering techniques and hierarchical matrix formats for kernel ridge regression, 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops, pp.883-892, 2018.

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

D. J. Rose and R. E. Tarjan, Algorithmic aspects of vertex elimination in directed graphs, SIAM Journal on Applied Mathematics, vol.34, issue.1, pp.176-197, 1978.

D. J. Rosenkrantz, R. E. Stearns, P. M. Lewis, and I. I. , An analysis of several heuristics for the traveling salesman problem, SIAM J. Comput, vol.6, issue.3, pp.563-581, 1977.

Y. Saad, Iterative methods for sparse linear systems, vol.82, 2003.

E. Schmidt, Über die auflösung linearer gleichungen mit unendlich vielen unbekannten, vol.25, pp.53-77, 1908.

T. Science and . Council, The HSL Mathematical Software Library. A collection of Fortran codes for large scale scientific computation

M. Sergent, D. Goudin, S. Thibault, and O. Aumage, Controlling the Memory Subscription of Distributed Applications with a Task-Based Runtime System, 21st International Workshop on High-Level Parallel Programming Models and Supportive Environments, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01284004

W. M. Sid-lakhdar, Scaling the solution of large sparse linear systems using multifrontal methods on hybrid shared-distributed memory architectures, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01111259

D. A. Sushnikova and I. V. Oseledets, Compress and eliminate" solver for symmetric positive definite sparse matrices, 2016.

W. F. Tinney and J. W. Walker, Direct solutions of sparse network equations by optimally ordered triangular factorization, Proceedings of the IEEE, vol.55, pp.1801-1809, 1967.

S. Wang, X. S. Li, F. Rouet, J. Xia, and M. V. De-hoop, A Parallel Geometric Multifrontal Solver Using Hierarchically Semis-Separable Structure, ACM Trans. Math. Softw, vol.42, issue.3, p.21, 2016.

C. Weisbecker, Improving multifrontal solvers by means of algebraic block low-rank representations, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00934939

J. L. Xia, Randomized sparse direct solvers, SIAM Journal on Matrix Analysis and Applications, vol.34, issue.1, pp.197-227, 2013.

J. L. Xia, S. Chandrasekaran, M. Gu, and X. S. Li, Superfast Multifrontal Method For Large Structured Linear Systems of Equations, SIAM Journal on Matrix Analysis and Applications, vol.31, pp.1382-1411, 2009.

J. Xiao, M. Gu, and J. Langou, Fast parallel randomized qr with column pivoting algorithms for reliable low-rank matrix approximations, 2017 IEEE 24th International Conference on High Performance Computing (HiPC), pp.233-242, 2017.

I. Yamazaki and X. S. Li, On techniques to improve robustness and scalability of a parallel hybrid linear solver, International Conference on High Performance Computing for Computational Science, pp.421-434, 2010.

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

C. D. Yu, J. Levitt, S. Reiz, and G. Biros, Geometry-oblivious fmm for compressing dense spd matrices, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, p.53, 2017.

G. Pichon, E. Darve, M. Faverge, P. Ramet, and J. Roman, Sparse supernodal solver using block low-rank compression: Design, performance and analysis, International Journal of Computational Science and Engineering, vol.27, pp.255-270, 2018.

G. Pichon, M. Faverge, P. Ramet, and J. Roman, Reordering strategy for blocking optimization in sparse linear solvers, SIAM Journal on Matrix Analysis and Applications, vol.38, issue.1, pp.226-248, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01485507

G. Pichon, E. Darve, M. Faverge, P. Ramet, and J. Roman, Sparse Supernodal Solver Using Block Low-Rank Compression, PDSEC'2017 workshop of IPDPS, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01502215

G. Pichon, A. Haidar, M. Faverge, and J. Kurzak, Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures, 29th IEEE International Parallel & Distributed Processing Symposium, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078356

, French conferences with proceedings

G. Pichon, Utilisation de la compression Block Low-Rank pour accélérer un solveur direct creux supernodal, Conférence d'informatique en Parallélisme, Architecture et Système (ComPAS'17), 2017.

M. Faverge, G. Pichon, and P. Ramet, Exploiting Kepler architecture in sparse direct solver with runtime systems, 9th International Workshop on Parallel Matrix Algorithms and Applications (PMAA'2016), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01421372

M. Faverge, G. Pichon, P. Ramet, and J. Roman, Blocking strategy optimizations for sparse direct linear solver on heterogeneous architectures, Sparse Days, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01187881

M. Faverge, G. Pichon, P. Ramet, and J. Roman, On the use of H-Matrix Arithmetic in PaStiX: a Preliminary Study, In Workshop on Fast Solvers, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01187882

G. Pichon, E. Darve, M. Faverge, P. Ramet, and J. Roman, Exploiting HMatrices in Sparse Direct Solvers, SIAM Conference on Parallel Processing for Scientific Computing, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01251812

G. Pichon, E. Darve, M. Faverge, P. Ramet, and J. Roman, On the use of low rank approximations for sparse direct solvers, SIAM Annual Meeting (AN'16), 2016.
URL : https://hal.archives-ouvertes.fr/hal-01421376

G. Pichon, E. Darve, M. Faverge, P. Ramet, and J. Roman, Sparse Supernodal Solver Using Hierarchical Compression, Workshop on Fast Direct Solvers, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01421368

G. Pichon, E. Darve, M. Faverge, P. Ramet, and J. Roman, Sparse Supernodal Solver exploiting Low-Rankness Property, Sparse Days, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01585622

G. Pichon, E. Darve, M. Faverge, P. Ramet, and J. Roman, Sparse Supernodal Solver Using Hierarchical Compression over Runtime System, SIAM Conference on Computation Science and Engineering (CSE'17), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01421379

G. Pichon, M. Faverge, and P. Ramet, Exploiting Modern Manycore Architecture in Sparse Direct Solver with Runtime Systems, SIAM Conference on Computation Science and Engineering (CSE'17), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01421383

G. Pichon, M. Faverge, P. Ramet, and J. Roman, Impact of blocking strategies for sparse direct solvers on top of generic runtimes, SIAM Conference on Parallel Processing for Scientific Computing, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01251808

G. Pichon, M. Faverge, P. Ramet, and J. Roman, Impact of Blocking Strategies for Sparse Direct Solvers on Top of Generic Runtimes, SIAM Conference on Computation Science and Engineering (CSE'17), 2017.
URL : https://hal.archives-ouvertes.fr/hal-01251808

, French conferences without proceedings

G. Pichon, E. Darve, M. Faverge, S. Lanteri, P. Ramet et al., Sparse supernodal solver with low-rank compression for solving the frequencydomain Maxwell equations discretized by a high order HDG method, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01660653