A. Sommaire and .. Gauss, 1 Factorisation par élimination de, p.105

.. Algorithmes-de-renumérotation, 109 A.2.1 L'algorithme de dissection emboîtée 110 A.2.2 L'algorithme de degré minimum et ses variantes, 110 A.2.3 L'algorithme de Cuthill -McKee . . . . . . . . . . . . . . . 111

J. Akhter and . Roberts, Multi-Core Programming : Increasing Performance Through Software Multithreading, 2006.

P. 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, and J. Excellent, Multifrontal parallel distributed symmetric and unsymmetric solvers, Computer Methods in Applied Mechanics and Engineering, vol.184, issue.2-4, pp.501-520, 2000.
DOI : 10.1016/S0045-7825(99)00242-X
URL : https://hal.archives-ouvertes.fr/hal-00856651

C. Ashcraft and R. Grimes, SPOOLES : An object-oriented sparse matrix library, Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, 1999.

M. Bhardwaj, D. Day, C. Farhat, M. Lesoinne, K. Pierson et al., Application of the FETI method to ASCI problems -scalability results on one thousand processors and discussion of highly heterogeneous problems, International Journal for Numerical Methods in Engineering, vol.47, pp.513-535, 2000.
DOI : 10.2172/6127

T. N. Bui and B. Moon, Genetic algorithm and graph partitioning, IEEE Transactions on Computers, vol.45, issue.7, pp.841-855, 1996.

R. Chandra, R. Menon, L. Dagum, D. Kohr, D. Maydan et al., Parallel Programming in OpenMP, 2000.

P. Charrier and J. Roman, Algorithmic study and complexity bounds for a nested dissection solver, Numerische Mathematik, vol.8, issue.4, pp.463-476, 1989.
DOI : 10.1007/BF01396049

D. Prescott and . Crout, A Short Method for Evaluating Determinants and Solving Systems of Linear Equations With Real or Complex Coefficients, AIEE Transactions, vol.60, pp.1235-1240, 1941.

E. Cuthill and J. 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

J. W. Demmel, J. R. Gilbert, and X. S. Li, An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.4, pp.915-952, 1999.
DOI : 10.1137/S0895479897317685

G. Dhatt, G. Touzot, and E. E. Lefrançois, Méthode des éléments finis, 2005.

J. J. Dongarra, I. S. Duff, J. Du-croz, E. S. Hammarling, S. Duff et al., A set of Level 3 Basic Linear Algebra Subprograms An implementation of Tarjan's algorithm for the block triangularization of a matrix, ACM Transactions on Mathematical Bibliographie I. ACM Transactions on Mathematical Software, vol.4, issue.2, pp.137-147, 1978.

D. Dureisseix and P. Ladevèze, A multi-level and mixed domain decomposition approach for structural analysis, Contemporary Mathematics, vol.218, pp.246-253, 1998.

C. Farhat, P. S. Chen, and E. J. Mandel, A scalable Lagrange multiplier based domain decomposition method for time-dependent problems, International Journal for Numerical Methods in Engineering, vol.38, issue.22, pp.3831-3858, 1995.
DOI : 10.1002/nme.1620382207

C. Farhat, P. S. Chen, J. Mandel, and F. Roux, The two-level FETI method Part II: Extension to shell problems, parallel implementation and performance results, Computer Methods in Applied Mechanics and Engineering, vol.155, issue.1-2, pp.153-180, 1998.
DOI : 10.1016/S0045-7825(97)00145-X

C. Farhat, L. Crivelli, and F. Roux, Extending substructure based iterative solvers to multiple load and repeated analyses, Computer Methods in Applied Mechanics and Engineering, vol.117, issue.1-2, pp.195-200, 1994.
DOI : 10.1016/0045-7825(94)90083-3

C. Farhat, M. Lesoinne, P. Le-tallec, K. Pierson, and E. D. Rixen, FETI-DP: a dual-primal unified FETI method?part I: A faster alternative to the two-level FETI method, International Journal for Numerical Methods in Engineering, vol.7, issue.7, pp.1523-1544, 2001.
DOI : 10.1002/nme.76

C. Farhat, A. Macedo, M. Lesoinne, F. Roux, F. Magoulès et al., Two-level domain decomposition methods with Lagrange multipliers for the fast iterative solution of acoustic scattering problems, Computer Methods in Applied Mechanics and Engineering, vol.184, issue.2-4, pp.213-239, 2000.
DOI : 10.1016/S0045-7825(99)00229-7
URL : https://hal.archives-ouvertes.fr/hal-00624498

C. Farhat and J. Mandel, The two-level FETI method for static and dynamic plate problems Part I: An optimal iterative solver for biharmonic systems, Computer Methods in Applied Mechanics and Engineering, vol.155, issue.1-2, pp.129-151, 1998.
DOI : 10.1016/S0045-7825(97)00146-1

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

C. Farhat, K. Pierson, and E. M. Lesoinne, The second generation FETI methods and their application to the parallel solution of large-scale linear and geometrically non-linear structural analysis problems, Computer Methods in Applied Mechanics and Engineering, vol.184, issue.2-4, pp.333-374, 2000.
DOI : 10.1016/S0045-7825(99)00234-0

C. Farhat and F. Roux, A method of finite element tearing and interconnecting and its parallel solution algorithm, International Journal for Numerical Methods in Engineering, vol.28, issue.6, pp.1205-1227, 1991.
DOI : 10.1002/nme.1620320604

C. Farhat and F. Roux, Implicit parallel processing in structural mechanics, Computational Mechanics Advances, pp.1-124, 1994.

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

A. George and J. W. Liu, Computer solution of large sparse positive definite systems, 1981.

A. George and J. W. Liu, The Evolution of the Minimum Degree Ordering Algorithm, SIAM Review, vol.31, issue.1, pp.1-19, 1989.
DOI : 10.1137/1031001

M. Géradin, D. Coulon, and J. Delsemme, Parallelization of the Samcef Finite Element Software Through Domain Decomposition and Feti Algorithm, International Journal of High Performance Computing Applications, vol.11, issue.4, pp.286-298, 1997.
DOI : 10.1177/109434209701100403

P. Gosselet and C. Rey, Non-overlapping domain decomposition methods in structural mechanics, Archives of Computational Methods in Engineering, vol.48, issue.2, pp.515-572, 2006.
DOI : 10.1007/BF02905857
URL : https://hal.archives-ouvertes.fr/hal-01224408

I. Guèye, X. Juvigny, F. Feyel, F. Roux, and E. G. Cailletaud, Mise en oeuvre d'un solveur direct parallèle pour l'inversion des problèmes locaux au sein d'une méthode de décomposition de domaine. 9ème Colloque National en Calcul de Structures

I. Guèye, X. Juvigny, F. Roux, F. Feyel, and E. G. Cailletaud, Analyse et développement d'algorithmes parallèles pour la résolution directe de grands systèmes linéaires creux. 18ème Congrès Français de Mécanique, 2007.

A. Gupta, G. Karypis, and E. V. Kumar, Highly scalable parallel algorithms for sparse matrix factorization. Rep. tech, IEEE Transactions on Parallel and Distributed Systems, 1994.

M. Heath, E. G. Ng, and E. B. Peyton, Parallel Algorithms for Sparse Linear Systems, SIAM Review, vol.33, issue.3, pp.420-460, 1991.
DOI : 10.1137/1033099

P. Hénon, P. Ramet, and E. 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

. Intel, Tera-scale Computing Research Program

B. M. Irons, A frontal solution program for finite element analysis, International Journal for Numerical Methods in Engineering, vol.3, issue.1, pp.5-32, 1970.
DOI : 10.1002/nme.1620020104

X. Juvigny, Résolution de grands systèmes linéaires sur machines massivement parallèles, Thèse de doctorat, 1997.

G. Karypis and V. Kumar, METIS : Unstructured graph partitioning and sparse matrix ordering system, 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, 1999.
DOI : 10.1137/S1064827595287997

P. Lascaux and R. Théodor, Analyse numérique matricielle appliquée à l'art de l'ingénieur, Dunod, vol.1, 2004.

P. Lascaux and R. Théodor, Analyse numérique matricielle appliquée à l'art de l'ingénieur, Dunod, vol.2, 2004.

L. Tallec, Domain decomposition methods in computational mechanics, Computational Mechanics Advances, vol.1, issue.2, pp.121-220, 1994.

B. Lewis and D. J. Berg, Multithreaded Programming with Pthreads, 1998.

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

P. L. Lions, On the Schwarz Alternating Method I, First International Symposium on Domain Decomposition Methods SIAM, pp.1-42, 1988.

J. W. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Transactions on Mathematical Software, vol.11, issue.2, pp.141-153, 1985.
DOI : 10.1145/214392.214398

J. W. Liu, The Role of Elimination Trees in Sparse Factorization, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.132-172, 1990.
DOI : 10.1137/0611010

J. W. Liu and A. Sherman, Comparative Analysis of the Cuthill???McKee and the Reverse Cuthill???McKee Ordering Algorithms for Sparse Matrices, SIAM Journal on Numerical Analysis, vol.13, issue.2, pp.198-213, 1975.
DOI : 10.1137/0713020

J. Mandel, Balancing domain decomposition, Communications in Numerical Methods in Engineering, vol.13, issue.3, pp.233-241, 1993.
DOI : 10.1002/cnm.1640090307

E. G. Ng and P. Raghavan, Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.4, pp.902-914, 1999.
DOI : 10.1137/S0895479897319313

P. Raghavan, Page d'accueil DSCPack, 2001.

P. Raghavan, DSCPack : Domain Separator Codes for the parallel solution of sparse linear systems, pp.16802-6106, 2002.

P. A. Raviart and J. M. Thomas, Introduction à l'analyse numérique des équations aux dérivées partielles. Dunod, 1998.

E. Rothberg, Exploiting the memory hierarchy in sequential and parallel sparse Cholesky factorization, Thèse de doctorat, 1992.

F. Roux, Méthode de décomposition de domaine à l'aide de multiplicateurs de Lagrange et application à la résolution parallèle des équations de l'élasticité linéaire, Thèse de doctorat, 1989.

W. F. Tinney and J. W. Walker, Direct solutions of sparse network equations by optimally ordered triangular factorization, Proceedings of the IEEE, pp.1801-1809, 1967.
DOI : 10.1109/PROC.1967.6011