Premium
The iterative group implicit algorithm for parallel transient finite element analysis
Author(s) -
Modak Sukomal,
Sotelino Elisa D.
Publication year - 2000
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(20000210)47:4<869::aid-nme803>3.0.co;2-g
Subject(s) - algorithm , iterative method , computer science , finite element method , parallel algorithm , group (periodic table) , scalability , degrees of freedom (physics and chemistry) , physics , quantum mechanics , chemistry , organic chemistry , database , thermodynamics
The Iterative Group Implicit (IGI) algorithm is developed for the parallel solution of general structural dynamic problems. In this method the original structure is partitioned into a number of a subdomains. Each subdomain is solved independently and therefore concurrently, using any traditional direct solution method. The IGI algorithm is an extension of the Group Implicit (GI) algorithm, and similarly to that method compatibility of the interface degrees of freedom is restored using a mass averaging rule. However, unlike the GI algorithm, in the IGI algorithm an iterative procedure is devised to restore equilibrium at the interface degrees of freedom. The IGI method has the same algorithmic characteristics as the underlying solution method used to solve each subdomain. Furthermore, the solution obtained by this method, once the iteration converges, is the same as the one obtained if the subdomain solution method is used to solve the whole structure. Numerical studies are carried out which demonstrate that the performance of the IGI algorithm is superior to that of the GI algorithm both in terms of accuracy and efficiency. Finally, the IGI method is highly modular and scalable, and therefore very well suited for distributed and parallel computing. Copyright © 2000 John Wiley & Sons, Ltd.