A parallel algorithm for direct solution of large sparse linear systems, well suitable to domain decomposition methods

2009 ◽  
Vol 18 (7-8) ◽  
pp. 589-605 ◽  
Author(s):  
Ibrahima Gueye ◽  
Xavier Juvigny ◽  
Frédéric Feyel ◽  
François-Xavier Roux ◽  
Georges Cailletaud
Author(s):  
Ibrahima Gueye ◽  
Xavier Juvigny ◽  
Frédéric Feyel ◽  
François-Xavier Roux ◽  
Georges Cailletaud

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.


1996 ◽  
Vol 32 (19) ◽  
pp. 1766
Author(s):  
K.N. Balasubramanya Murthy ◽  
C. Siva Ram Murthy

Sign in / Sign up

Export Citation Format

Share Document