A. Appendix, A. I. Publications, X. S. Yamazaki, F. Li, B. Rouet et al., Partitioning, ordering, and load balancing in a parallel hybrid linear solver, 2012.

L. Bouchet, P. R. Amestoy, A. Buttari, F. Rouet, and M. Chauvin, Simultaneous analysis of large INTEGRAL/SPI datasets: optimizing the computation of the solution and its variance using sparse matrix algorithms, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01125193

L. Bouchet, P. R. Amestoy, A. Buttari, F. Rouet, and M. Chauvin, INTEGRAL/SPI data segmentation to retrieve source intensity variations, Astronomy & Astrophysics, vol.555, 2012.
DOI : 10.1051/0004-6361/201219605

D. , P. R. Amestoy, I. S. Duff, J. Excellent, Y. Robert et al., On computing inverse entries of a sparse matrix in an out-of-core environment, SIAM Journal on Scientific Computing, pp.34-1975, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00763556

E. K. Kaya, F. Rouet, and B. Uçar, On partitioning problems with complex objectives. Euro-Par 2011: Parallel Processing Workshops, A.3 Proceedings [, pp.2012-334
URL : https://hal.archives-ouvertes.fr/hal-00763548

F. E. Agullo, P. R. Amestoy, A. Buttari, A. Guermouche, J. Excellent et al., Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations, A.4 Conferences SIAM Conference on Parallel Processing for Scientific Computing (PP12), 2012.
DOI : 10.1137/130938505
URL : https://hal.archives-ouvertes.fr/hal-00726644

K. Kaya, F. Rouet, and B. Uçar, On partitioning problems with complex objectives. Workshop on Algorithms and Programming Tools for Next-Generation 169
URL : https://hal.archives-ouvertes.fr/hal-00763548

I. Yamazaki, X. S. Li, F. Rouet, and B. Uçar, Combinatorial problems in a parallel hybrid linear solver, SIAM Workshop on Combinatorial Scientific Computing (CSC11), 2011.
URL : https://hal.archives-ouvertes.fr/hal-00945063

P. R. Amestoy, I. Duff, J. Excellent, F. Rouet, and B. Uçar, Parallel Computation of Entries of ${A}^{-1}$, SIAM Journal on Scientific Computing, vol.37, issue.2, 2011.
DOI : 10.1137/120902616
URL : https://hal.archives-ouvertes.fr/hal-00759556

P. R. Amestoy, F. Rouet, and B. Uçar, Partitions and permutations for the partial inverse of a matrix, 2009.

P. R. Amestoy, F. Rouet, and B. Uçar, On computing arbitrary entries of the inverse of a matrix, SIAM Workshop on Combinatorial Scientific Computing (CSC09), 2009.

A. [. Reports, F. Kaya, B. Rouet, and . Uçar, On partitioning problems with complex objectives. INPT-IRIT technical report RT-APO-11-01, also appeared as INRIA- LIP and CERFACS, 2011.

I. [. Amestoy, Y. Duff, F. Robert, B. Rouet, and . Uçar, On computing inverse entries of a sparse matrix in an out-of-core environment. INPT- IRIT technical report RT-APO-10-06, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00763556

E. Agullo, On the out-of-core factorization of large sparse matrices, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00563463

E. Agullo, A. Guermouche, and J. Y. , Reducing the I/O volume in an out-of-core sparse multifrontal solver, High Performance Computing ? HiPC, pp.47-58, 2007.

P. R. Amestoy, Factorization of large sparse matrices based on a multifrontal approach in a multiprocessor environment, 1991.

P. R. Amestoy, C. Ashcraft, A. Buttari, O. Boiteau, J. Excellent et al., Improving multifrontal methods by means of block low-rank approximation techniques, tech. rep, pp.INPT-IRIT, 2012.

P. R. Amestoy, A. Buttari, A. Guermouche, J. Excellent, and M. Sid-lakhdar, Exploiting multithreaded tree parallelism for multicore systems in a parallel multifrontal solver, Feb, SIAM conference on Parallel Processing for Scientific Computing (PP12), 2012.

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 and I. S. Duff, Vectorization of a Multiprocessor Multifrontal Code, International Journal of High Performance Computing Applications, vol.3, issue.3, pp.41-59, 1989.
DOI : 10.1177/109434208900300303

P. R. Amestoy, I. S. Duff, A. Guermouche, and T. Slavova, Analysis of the solution phase of a parallel multifrontal approach, Parallel Computing, vol.36, issue.1, pp.3-15, 2010.
DOI : 10.1016/j.parco.2009.06.001
URL : https://hal.archives-ouvertes.fr/inria-00413470

P. R. Amestoy, I. S. Duff, J. Koster, and J. Excellent, A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001.
DOI : 10.1137/S0895479899358194
URL : https://hal.archives-ouvertes.fr/hal-00808293

P. R. Amestoy, I. S. Duff, and C. Vomel, Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.2, pp.544-565, 2005.
DOI : 10.1137/S0895479802419877

P. R. Amestoy, A. Guermouche, J. Excellent, and S. Pralet, Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, vol.32, issue.2, pp.136-156, 2006.
DOI : 10.1016/j.parco.2005.07.004
URL : https://hal.archives-ouvertes.fr/hal-00358623

P. R. Amestoy and C. Puglisi, An Unsymmetrized Multifrontal LU Factorization, SIAM Journal on Matrix Analysis and Applications, vol.24, issue.2, pp.553-569, 2003.
DOI : 10.1137/S0895479800375370

M. Arioli, I. S. Duff, J. Noailles, and D. Ruiz, A Block Projection Method for Sparse Matrices, SIAM Journal on Scientific and Statistical Computing, vol.13, issue.1, p.47, 1992.
DOI : 10.1137/0913003

C. Ashcraft, S. C. Eisenstat, J. W. Liu, and A. H. Sherman, A comparison of three column-based distributed sparse factorization schemes, Tech. Rep. AD-A228-143, 1990.

C. Aykanat, A. Pinar, and Ü. V. Çatalyürek, Permuting Sparse Rectangular Matrices into Block-Diagonal Form, SIAM Journal on Scientific Computing, vol.25, issue.6, pp.1860-1879, 2004.
DOI : 10.1137/S1064827502401953

A. Banegas, Fast Poisson solvers for problems with sparsity, Mathematics of Computation, vol.32, issue.142, pp.441-446, 1978.
DOI : 10.1090/S0025-5718-1978-0483338-8

O. Beaumont and A. Guermouche, Task scheduling for parallel multifrontal methods, Euro-Par, Parallel Processing, pp.758-766, 2007.

C. Bekas and A. , Curioni, and I. Fedulova, Low cost high performance uncertainty quantification, Proceedings of the 2nd Workshop on High Performance Computational Finance, p.8, 2009.

Å. Björck, Numerical methods for least squares problems, Society for Industrial Mathematics, 1996.
DOI : 10.1137/1.9781611971484

L. Bouchet, P. R. Amestoy, A. Buttari, F. Rouet, and M. Chauvin, IN- TEGRAL/SPI data segmentation to retrieve sources intensity variations, 2012.

L. Bouchet, J. Roques, P. Mandrou, A. Strong, R. Diehl et al., INTEGRAL/SPI observation of the galactic central radian: Contribution of discrete sources and implication for the diffuse emission 1, The Astrophysical Journal, pp.635-1103, 2005.

Y. E. Campbell and T. A. Davis, Computing the sparse inverse subset: an inverse multifrontal approach, 1995.

S. Cauley, J. Jain, C. K. Koh, and V. Balakrishnan, A scalable distributed method for quantum-scale device simulation, Journal of Applied Physics, vol.101, issue.12, p.123715, 2007.
DOI : 10.1063/1.2748621

Ü. V. Çatalyürek and C. Aykanat, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication PaToH: A multilevel hypergraph partitioning tool, IEEE Transactions on Parallel and Distributed Systems, vol.1027, pp.673-693, 1999.

C. Chevalier and F. Pellegrini, PT-Scotch: A tool for efficient parallel graph ordering, Parallel Computing, vol.34, issue.6-8, pp.318-331, 2008.
DOI : 10.1016/j.parco.2007.12.001
URL : https://hal.archives-ouvertes.fr/hal-00402893

T. A. Davis and I. S. Duff, An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization, SIAM Journal on Matrix Analysis and Applications, vol.18, issue.1, pp.140-158, 1997.
DOI : 10.1137/S0895479894246905

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Mathematical Programming, pp.201-213, 2002.
DOI : 10.1007/s101070100263

I. S. Duff and J. K. Reid, The Multifrontal Solution of Indefinite Sparse Symmetric Linear, ACM Transactions on Mathematical Software, vol.9, issue.3, pp.302-325, 1983.
DOI : 10.1145/356044.356047

S. C. Eisenstat and J. W. Liu, The Theory of Elimination Trees for Sparse Unsymmetric Matrices, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.3, pp.686-705, 2005.
DOI : 10.1137/S089547980240563X

A. M. Erisman and W. F. Tinney, On computing certain elements of the inverse of a sparse matrix, Communications of the ACM, vol.18, issue.3, pp.177-179, 1975.
DOI : 10.1145/360680.360704

J. Gaidamour and P. Hénon, HIPS: a parallel hybrid direct/iterative solver based on a schur complement approach, Proceedings of PMAA, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00353595

M. R. Garey and D. S. Johnson, Computers and intractability; A guide to the theory of NP-completeness, 1979.

G. A. Geist and E. G. Ng, Task scheduling for parallel sparse Cholesky factorization, International Journal of Parallel Programming, vol.27, issue.4, pp.291-314, 1989.
DOI : 10.1007/BF01407861

A. George, Nested Dissection of a Regular Finite Element Mesh, SIAM Journal on Numerical Analysis, vol.10, issue.2, pp.10-345, 1973.
DOI : 10.1137/0710032

A. George, M. T. Heath, J. W. Liu, and E. G. Ng, Solution of sparse positive definite systems on a hypercube, Journal of Computational and Applied Mathematics, vol.27, issue.1-2, pp.129-156, 1989.
DOI : 10.1016/0377-0427(89)90364-6

A. George, J. W. Liu, and E. G. Ng, Communication results for parallel sparse Cholesky factorization on a hypercube, Parallel Computing, vol.10, issue.3, pp.287-298, 1989.
DOI : 10.1016/0167-8191(89)90101-4

J. R. Gilbert, Predicting Structure in Sparse Matrix Computations, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.1, pp.62-79, 1994.
DOI : 10.1137/S0895479887139455

J. R. Gilbert and J. W. Liu, Elimination Structures for Unsymmetric Sparse $LU$ Factors, SIAM Journal on Matrix Analysis and Applications, vol.14, issue.2, 1993.
DOI : 10.1137/0614024

J. R. Gilbert, G. L. Miller, and S. Teng, Geometric Mesh Partitioning: Implementation and Experiments, SIAM Journal on Scientific Computing, vol.19, issue.6, pp.2091-2110, 1998.
DOI : 10.1137/S1064827594275339
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.3807

L. Giraud, A. Haidar, and L. T. Watson, Parallel scalability study of hybrid preconditioners in three dimensions, Parallel Computing, vol.34, issue.6-8, pp.363-379, 2008.
DOI : 10.1016/j.parco.2008.01.006

R. L. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.
DOI : 10.1002/j.1538-7305.1966.tb01709.x

A. Guermouche and J. Y. , Constructing memory-minimizing schedules for multifrontal methods, ACM Transactions on Mathematical Software, vol.32, issue.1, pp.17-32, 2006.
DOI : 10.1145/1132973.1132975
URL : https://hal.archives-ouvertes.fr/hal-00358620

A. Gupta, Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices, SIAM Journal on Matrix Analysis and Applications, vol.24, issue.2, pp.529-552, 2002.
DOI : 10.1137/S089547980139604X

J. A. Hall and K. I. Mckinnon, Hyper-Sparsity in the Revised Simplex Method and How to Exploit it, Computational Optimization and Applications, vol.10, issue.5, pp.259-283, 2005.
DOI : 10.1007/s10589-005-4802-0

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

T. Hoefler, A. Lumsdaine, and W. Rehm, Implementation and performance analysis of non-blocking collective operations for MPI, Proceedings of the 2007 ACM/IEEE conference on Supercomputing , SC '07, 2007.
DOI : 10.1145/1362622.1362692

M. Jacquelin, L. Marchal, Y. Robert, and B. Uçar, On Optimal Tree Traversals for Sparse Matrix Factorization, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.556-567, 2011.
DOI : 10.1109/IPDPS.2011.60
URL : https://hal.archives-ouvertes.fr/hal-00945078

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

K. Kaya, F. Rouet, and B. Uçar, On Partitioning Problems with Complex Objectives, Euro-Par 2011: Parallel Processing Workshops, pp.334-344, 2012.
DOI : 10.1007/978-3-642-29737-3_38
URL : https://hal.archives-ouvertes.fr/hal-00763548

T. Lengauer, Combinatorial algorithms for integrated circuit layout, 1990.
DOI : 10.1007/978-3-322-92106-2

J. Excellent, Multifrontal methods for large sparse systems of linear equations: parallelism, memory usage, performance optimization and numerical issues, 2012.

S. Li, S. Ahmed, G. Klimeck, and E. Darve, Computing entries of the inverse of a sparse matrix using the FIND algorithm, Journal of Computational Physics, vol.227, issue.22, pp.9408-9427, 2008.
DOI : 10.1016/j.jcp.2008.06.033

S. Li and E. Darve, Optimization of the FIND Algorithm to Compute the Inverse of a Sparse Matrix, 2009 13th International Workshop on Computational Electronics, pp.1-4, 2009.
DOI : 10.1109/IWCE.2009.5091136

X. S. Li and J. W. , SuperLU_DIST, ACM Transactions on Mathematical Software, vol.29, issue.2, pp.29-110, 2003.
DOI : 10.1145/779359.779361

X. S. Li, M. Shao, I. Yamazaki, and E. G. Ng, Factorization-based sparse solvers and preconditioners, Journal of Physics: Conference Series, p.12015, 2009.

L. Lin, J. Lu, L. Ying, R. Car, and W. E. , Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems, Communications in Mathematical Sciences, vol.7, pp.755-777, 2009.

L. Lin, C. Yang, J. Lu, L. Ying, and W. E. , A fast parallel algorithm for selected inversion of structured sparse matrices with application to 2D electronic structure calculations, SIAM Journal on Scientific Computing, pp.33-1329, 2011.

L. Lin, C. Yang, J. C. Meza, J. Lu, L. Ying et al., SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix, ACM Transactions on Mathematical Software, vol.37, issue.4, pp.37-40, 2011.
DOI : 10.1145/1916461.1916464

J. W. Liu, On the storage requirement in the out-of-core multifrontal method for sparse factorization, ACM Transactions on Mathematical Software, vol.12, issue.3, pp.249-264, 1986.
DOI : 10.1145/7921.11325

M. Luisier, A. Schenk, W. Fichtner, and G. Klimeck, Atomistic simulation of nanowires in the sp 3 d 5 s * tight-binding formalism: From boundary conditions to strain calculations, Physical Review B, pp.74-205323, 2006.

H. Niessner and K. Reichert, On computing the inverse of a sparse matrix, International Journal for Numerical Methods in Engineering, vol.6, issue.10, pp.1513-1526, 1983.
DOI : 10.1002/nme.1620191009

F. Pellegrini and J. 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

A. Pothen and C. Sun, A Mapping Algorithm for Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific Computing, vol.14, issue.5, pp.1253-1253, 1993.
DOI : 10.1137/0914074

A. Pothen and S. Toledo, Elimination structures in scientific computing, in Handbook of data structures and applications, pp.1-29, 2004.

G. N. Prasanna and B. R. Musicus, Generalized multiprocessor scheduling and applications to matrix computations, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.6, pp.650-664, 1996.
DOI : 10.1109/71.506703

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, 2012.
DOI : 10.1109/IPDPS.2012.64

F. Rouet, Partial computation of the inverse of large, sparse matrix ? application to astrophysics, Master's thesis, 2009.

C. Sánchez, H. B. Sipma, Z. Manna, and C. D. Gill, Efficient distributed deadlock avoidance with liveness guarantees, Proceedings of the 6th ACM & IEEE International conference on Embedded software , EMSOFT '06, p.20, 2006.
DOI : 10.1145/1176887.1176891

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

R. Schreiber, A New Implementation of Sparse Gaussian Elimination, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.256-276, 1982.
DOI : 10.1145/356004.356006

J. Schulze, Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods, BIT, pp.41-800, 2001.

. Tz, C. Slavova, and T. /. Pa, Parallel triangular solution in an out-of-core multifrontal approach for solving large sparse linear systems, 2009.

B. F. Smith, P. E. Bjørstad, and W. Gropp, Domain Decomposition, 2004.
DOI : 10.1007/978-3-540-70529-1_411

K. Takahashi, J. Fagan, and M. Chin, Formation of a sparse bus impedance matrix and its application to short circuit study, Proceedings 8th PICA Conference, 1973.

J. Tang and Y. Saad, A probing method for computing the diagonal of the matrix inverse, Tech. Rep. umsi-2010-42, Minnesota Supercomputer Institute Uçar and C. Aykanat, Encapsulating multiple communication-cost metrics in partitioning sparse rectangular matrices for parallel matrix-vector multiplies, SIAM Journal on Scientific Computing, pp.25-1837, 2004.

S. Wang, X. S. Li, J. Xia, Y. Situ, and M. V. De-hoop, Efficient scalable algorithms for hierarchically semiseparable matrices, 2012.

I. Yamazaki, X. S. Li, F. Rouet, and B. Uçar, Partitioning, ordering, and load balancing in a hierarchically parallel hybrid linear solver, International Journal of High Performance Computing Applications, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00797207

M. Yannakakis, Computing the Minimum Fill-In is NP-Complete, SIAM Journal on Algebraic Discrete Methods, vol.2, issue.1, pp.77-79, 1981.
DOI : 10.1137/0602010