Open AccessA parallel algorithm for direct solution of large sparse linear systems, well suitable to domain decomposition methods
Author(s) -
Ibrahima Gueye,
Xavier Juvigny,
Frédéric Feyel,
FrançoisXavier Roux,
Georges Cailletaud
Publication year - 2009
Publication title -
european journal of computational mechanics
Language(s) - English
Resource type - Journals
eISSN - 2642-2085
pISSN - 2642-2050
DOI - 10.13052/ejcm.18.589-605
Subject(s) - domain decomposition methods , solver , feti , computer science , parallel computing , parallelism (grammar) , domain (mathematical analysis) , algorithm , finite element method , computational science , mathematics , mathematical analysis , physics , thermodynamics , programming language
The goal of this paper is to develop a parallel algorithm for the direct solution of large sparse linear systems and integrate it into domain decomposition methods. The computational effort for these linear systems, often encountered in numerical simulation of structural mechanics problems by finite element codes, is very significant in terms of run-time and memory requirements.In this paper, a two-level parallelism is exploited. The exploitation of the lower level of parallelism is based on the development of a parallel direct solver with a nested dissection algorithm and to introduce it into the FETI methods. This direct solver has the advantage of handling zero-energy modes in floating structures automatically and properly. The upper level of parallelism is a coarse-grain parallelism between substructures of FETI. Some numerical tests are carried out to evaluate the performance of the direct solver.