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.
DOI : 10.1137/S0895479894278952

P. R. Amestoy, I. S. Duff, J. Koster, J. Amestoy, I. S. Duff et al., A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling A Fan-in Algorithm for Distributed Sparse Numerical Factorization, Multifrontal Parallel Distributed Symmetric and Unsymmetric Solvers, pp.15-41501, 1990.

L. E. Agullo, A. Giraud, A. Guermouche, J. Haidar, and . Roman, Parallel Algebraic Domain Decomposition Solver for the Solution of Augmented Systems Advances in Engineering Software, pp.60-6123, 2013.

E. Agullo, L. Giraud, A. Guermouche, J. Romanash93-]-c, and . Ashcraft, Parallel Hierarchical Hybrid Linear Solvers for Emerging Computing Platforms The fan-both family of column-based distributed cholesky factorization algorithms, Compte Rendu de l'Académie des Sciences : Serie Mécanique Graph Theory and Sparse Matrix Computation, pp.96-103, 1993.

C. Augonnet, S. Thibault, R. Namyst, and P. A. Wacrenier, StarPU : a Unified Platform for Task Scheduling on Heterogeneous Multicore Architectures. Concurrency and Computation : Practice and Experience, pp.187-198, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00384363

]. A. Bra86 and . Brandt, Algebraic Multigrid Theory : the Symmetric Case, Applied mathematics and computation, vol.19, issue.1 5, pp.23-56, 1986.

J. [. Cuthill and . Mckee, Reducing the bandwidth of sparse symmetric matrices, Proceedings of the 1969 24th national conference on -, pp.157-172, 1969.
DOI : 10.1145/800195.805928

T. [. Chan and . Mathew, The Interface Probing Technique in Domain Decomposition, CR89] P. Charrier and J. Roman. Algorithmique et calculs de complexité pour un solveur de type dissections emboîtées. Numerische Mathematik, pp.212-238, 1989.
DOI : 10.1137/0613018

T. Davis, Y. Hu, . A. Timothy, and . Davis, The University of Florida Sparse Matrix Collection Direct methods for sparse linear systems, p.60, 2006.

D. , I. S. Duff, A. M. Erisman, J. K. Reiddk99-]-i, J. Duff et al., Direct Methods for Sparse Matrices The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices, SIAM J. Matrix Anal. Appl, vol.5, issue.204, pp.31889-901, 1921.

R. Diekmann, R. Preis, F. Schlimbach, and C. Walshaw, Shape-optimized mesh partitioning and load balancing for parallel adaptive FEM, Parallel Computing, vol.26, issue.12, pp.1555-1581, 2000.
DOI : 10.1016/S0167-8191(00)00043-0

R. [. Fiduccia and . Mattheyses, A Linear-time Heuristic for Improving Network Partitions, Proceedings of the 19th Design Automation Conference, DAC '82, pp.175-181, 1982.

C. Farhat, J. Mandel, and F. X. Roux, Optimal convergence properties of the FETI domain decomposition method, Computer Methods in Applied Mechanics and Engineering, vol.115, issue.3-4, pp.365-385, 1994.
DOI : 10.1016/0045-7825(94)90068-X

]. J. Gai09 and . Gaidamour, Design of a Parallel Hybrid Direct/Iterative Sparse Linear Solver. Theses, Université Sciences et Technologies -Bordeaux I, p.26, 2009.

L. Grigori, J. A. Demmel, and X. S. Li, Parallel Symbolic Factorization for Sparse LU with Static Pivoting, SIAM Journal on Scientific Computing, vol.29, issue.3, pp.1289-1314, 2007.
DOI : 10.1137/050638102

]. A. Geo73, ]. J. Georgegh08, P. Gaidamour, . Hénongh09-]-l, A. Giraud et al., A Parallel Direct/Iterative Solver Based on a Schur Complement Approach Parallel Algebraic Hybrid Solvers for Large 3D Convection- Diffusion Problems Parallel Cholesky Factorization on a Sharedmemory Multiprocessor, IEEE 11th International Conference on Computational Science and EngineeringGHS10] L. Giraud, A. Haidar, and Y. Saad. Sparse Approximations of the Schur Complement for Parallel Algebraic Hybrid Linear Solvers in 3D, pp.345-363, 1922.

A. Gupta, G. Karypis, and V. Kumar, Highly Scalable Parallel Algorithms for Sparse Matrix Factorization. Parallel and Distributed Systems, IEEE Transactions on, vol.8, issue.7 8, pp.502-520, 1981.

A. George and E. Ng, Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting, SIAM Journal on Scientific and Statistical Computing, vol.8, issue.6, pp.877-898, 1987.
DOI : 10.1137/0908072

]. A. Gup01 and . Gupta, Recent Progress in General Sparse Direct Solvers, Computational Science ? ICCS 2001, pp.823-831, 2001.

]. W. Hac85 and . Hackbusch, Multi-grid Methods and Applications, 1985.

]. W. Hac99, ]. Hackbuschhai08, and . Haidar, A Sparse Matrix Arithmetic Based on H-Matrices. Part I : Introduction to H-Matrices On the Parallel Scalability of Hybrid Linear Solvers for Large 3D Problems, Theses, Institut National Polytechnique de Toulouse -INPTHén01] P. Hénon. Distribution des Données et Régulation Statique des Calculs et des Communications pour la Résolution de Grands Systèmes Linéaires Creux par Méthode Directe, pp.89-108, 1999.

T. [. Hendrickson and . Kolda, Graph partitioning models for parallel computing, Parallel Computing, vol.26, issue.12, pp.1519-1534, 2000.
DOI : 10.1016/S0167-8191(00)00048-X

F. Hülsemann, M. Kowarschik, M. Mohr, and U. Rüde, Parallel Geometric Multigrid, Numerical Solution of Partial Differential Equations on Parallel Computers, pp.165-208, 2006.

R. [. Hendrickson and . Leland, A Multi-Level Algorithm For Partitioning Graphs, Supercomputing Proceedings of the IEEE/ACM SC95 Conference, pp.28-28, 1995.

M. T. Heath, E. Ng, B. W. Peytonhp99, ]. Hysom, and A. Pothen, Parallel Algorithms for Sparse Linear Systems Efficient Parallel Computation of ILU(K) Preconditioners, Proceedings of the 1999 ACM/IEEE Conference on Supercomputing, SC '99, pp.420-460, 1991.

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

P. Hénon, P. Ramet, and J. Roman, On Using an Hybrid MPI-Thread Programming for the Implementation of a Parallel Sparse Direct Solver on a Network of SMP Nodes, Proceedings of Sixth International Conference on Parallel Processing and Applied Mathematics, Workshop HPC Linear Algebra, pp.1050-1057, 2005.
DOI : 10.1007/11752578_127

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, 2008.
DOI : 10.1016/j.parco.2007.12.003

V. [. Karypis, . Kumarkk98a-]-g, V. Karypis, and . Kumar, Multilevel Graph Partitioning Schemes A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, Proc. 24th Intern. Conf. Par. Proc., III Karypis and V. Kumar. A Software Package For Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, pp.113-122, 1995.

]. G. Kk98c, V. Karypis, and . Kumar, Multilevel k-way Partitioning Scheme for Irregular Graphs SuperLU DIST : A Scalable Distributed-memory Sparse Direct Solver for Unsymmetric Linear Systems, Journal of Parallel and Distributed Computing ACM Trans. Mathematical Software, vol.48, issue.29 7, pp.96-129, 1998.

[. Excellent, Multifrontal Methods : Parallelism, Memory Usage and Numerical Aspects. Habilitation à diriger des recherches, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00737751

C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh, Basic Linear Algebra Subprograms for Fortran Usage, ACM Transactions on Mathematical Software, vol.5, issue.3, pp.308-323, 1979.
DOI : 10.1145/355841.355847

]. J. Liu90 and . Liu, The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1 8, pp.134-172, 1990.

]. J. Liu92, . J. Liulrt79-]-r, D. J. Lipton, R. E. Rose, and . Tarjan, The Multifrontal Method for Sparse Matrix Solution : Theory and Practice, Manteuffel. An Incomplete Factorization Technique for Positive Definite Linear Systems. Mathematics of Computation, pp.82-109, 1979.

H. Meyerhenke, B. Monien, and T. Sauerwald, A new diffusion-based multilevel algorithm for computing graph partitions, Journal of Parallel and Distributed Computing, vol.69, issue.9, pp.750-761, 2009.
DOI : 10.1016/j.jpdc.2009.04.005

G. L. Miller, S. Teng, and S. A. Vavasis, A unified geometric approach to graph separators, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.538-547, 1991.
DOI : 10.1109/SFCS.1991.185417

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

G. Esmond, P. Ng, and . Raghavan, Towards a scalable hybrid sparse solver. Concurrency : Practice and Experience, pp.53-68, 2000.

J. [. Pellegrini and . Roman, Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs, High-Performance Computing and Networking, pp.493-498, 1996.
DOI : 10.1007/3-540-61142-8_588

[. Pellegrini and J. Roman, Sparse matrix ordering with Scotch, High-Performance Computing and Networking, pp.370-378, 1997.
DOI : 10.1007/BFb0031609

F. Pellegrini, J. Roman, and P. Amestoy, Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering. Concurrency : Practice and Experience, pp.69-84, 2000.

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

]. Y. Saa94, . Saad, K. Schenk, and . Gärtner, ILUT : A dual threshold incomplete LU factorization Iterative Methods for Sparse Linear Systems Solving unsymmetric sparse systems of linear equations with PARDISO, Numerical Linear Algebra with Applications Society for Industrial and Applied Mathematics Journal of Future Generation Computer Systems, vol.1, issue.20 7, pp.387-402, 1994.

M. [. Saad and . Schultz, GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems, SIAM Journal on Scientific and Statistical Computing, vol.7, issue.3, pp.856-869, 1986.
DOI : 10.1137/0907058

[. Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.
DOI : 10.1145/321879.321884

S. Toledo, A. Uchitel, R. Wyrzykowski, J. Dongarra, K. Karczewski et al., A Supernodal Out-of-Core Sparse Gaussian-Elimination Method, Parallel Processing and Applied Mathematics, pp.728-737, 2005.
DOI : 10.1007/978-3-540-68111-3_76

]. O. Wid92, . Widlund-]-i, X. S. Yamazaki, and . Li, Some Schwarz Methods For Symmetric And Nonsymmetric Elliptic Problems On Techniques to Improve Robustness and Scalability of a Parallel Hybrid Linear Solver, Fifth International Symposium on Domain Decomposition Methods for Partial Differential Equations. SIAM High Performance Computing for Computational Science ? VECPAR 2010, pp.421-434, 1920.

A. Casadei, P. Ramet, and J. Roman, An improved recursive graph bipartitioning algorithm for well balanced domain decomposition, 2014 21st International Conference on High Performance Computing (HiPC), 2014.
DOI : 10.1109/HiPC.2014.7116878

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

]. A. Casadei and P. Ramet, Memory Optimization to Build a Schur Complement, Congrès internationaux avec sélection SIAM Conference on Applied Linear Algebra, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00769029

A. Casadei and P. Ramet, Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition, Workshops internationaux avec sélection Mini-Symposium on Combinatorial Issues in Sparse Matrix Computation at ICIAM'15 conference, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01100985

A. Casadei, P. Ramet, and J. Roman, Towards a recursive graph bipartitioning algorithm for well balanced domain decomposition, Mini-Symposium on Partitioning for Complex Objectives at SIAM CSE'15 conference, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01100985

A. Casadei, P. Ramet, and J. Roman, Nested Dissection with Balanced Halo, SIAM Workshop on Combinatorial Scientific Computing, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00987099

A. Casadei, L. Giraud, P. Ramet, and J. Roman, Towards Domain Decomposition with Balanced Halo, Workshop Celebrating 40 Years of Nested Dissection, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00924977

A. Casadei, P. Ramet, and J. Roman, An improved recursive graph bipartitioning algorithm for well balanced domain decomposition, 2014 21st International Conference on High Performance Computing (HiPC), 2014.
DOI : 10.1109/HiPC.2014.7116878

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

A. Casadei and P. Ramet, Memory Optimization to Build a Schur Complement in an Hybrid Solver
URL : https://hal.archives-ouvertes.fr/hal-00700053