Premium
Domain decomposition methods for parallel solution of shape sensitivity analysis problems
Author(s) -
Papadrakakis Manolis,
Tsompanakis Yiannis
Publication year - 1999
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/(sici)1097-0207(19990120)44:2<281::aid-nme512>3.0.co;2-1
Subject(s) - feti , domain decomposition methods , solver , mortar methods , computer science , decomposition , domain (mathematical analysis) , sensitivity (control systems) , decomposition method (queueing theory) , iterative method , finite element method , mathematical optimization , algorithm , computational science , mathematics , mathematical analysis , engineering , structural engineering , ecology , discrete mathematics , electronic engineering , biology
This paper presents the implementation of advanced domain decomposition techniques for parallel solution of large‐scale shape sensitivity analysis problems. The methods presented in this study are based on the FETI method proposed by Farhat and Roux which is a dual domain decomposition implementation. Two variants of the basic FETI method have been implemented in this study: (i) FETI‐1 where the rigid‐body modes of the floating subdomains are computed explicitly. (ii) FETI‐2 where the local problem at each subdomain is solved by the PCG method and the rigid‐body modes are computed explicitly. A two‐level iterative method is proposed particularly tailored to solve re‐analysis type of problems, where the dual domain decomposition method is incorporated in the preconditioning step of a subdomain global PCG implementation. The superiority of this two‐level iterative solver is demonstrated with a number of numerical tests in serial as well as in parallel computing environments. Copyright © 1999 John Wiley & Sons, Ltd.