Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 91
PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON CIVIL, STRUCTURAL AND ENVIRONMENTAL ENGINEERING COMPUTING Edited by: B.H.V. Topping, L.F. Costa Neves and R.C. Barros
Paper 117
A Non-linear Dynamic Parallel Domain Decomposition based Algorithm J. Dobiáš1, S. Pták1, Z. Dostál2, V. Vondrák2 and T. Kozubek2
1Institute of Thermomechanics, Prague, Czech Republic
, "A Non-linear Dynamic Parallel Domain Decomposition based Algorithm", in B.H.V. Topping, L.F. Costa Neves, R.C. Barros, (Editors), "Proceedings of the Twelfth International Conference on Civil, Structural and Environmental Engineering Computing", Civil-Comp Press, Stirlingshire, UK, Paper 117, 2009. doi:10.4203/ccp.91.117
Keywords: dynamics, domain decomposition, geometric non-linearity, material non-linearity, contact non-linearity, finite element method, parallel processing.
Summary
The paper is concerned with application of a novel variant of the FETI
(finite element tearing and interconnecting) domain decomposition method,
called the Total FETI (TFETI) [1], for the solution of dynamic non-linear problems of deformable bodies.
As the non-linear effects we consider geometric and material ones and also contact phenomena.
The basic theory and relationships that the TFETI method stems from
are briefly reviewed and the time stepping scheme, solution algorithm
and results of numerical experiments are shown.
The TFETI method belongs to the class of non-overlapping totally disconnected spatial decompositions. Its key concept is based on the idea that the compatibility between the spatial sub-domains, into which the original domain is partitioned, is ensured by Lagrange multipliers with the physical meaning of forces in this context. The primal variables, which are displacements in the displacement based finite element analysis, are eliminated so that we solve the problem for the dual variables or Lagrange multipliers. The difference between the FETI and TFETI is that the latter method, unlike the former one, also enforces the Dirichlet boundary conditions in terms of the Lagrange multipliers, which has a significant bearing on some segments of computations because of lesser sensitivity to round-off errors. The TFETI technique converts the original problem to a quadratic programming one and if applied to the contact problems, this approach transforms the general non-penetration constraints to the simple bound constraints [2]. After eliminating the primal variables, the original problem is reduced to a small and relatively well conditioned one which is solved iteratively. For application of the method to the high performance computers, it is essential that TFETI exhibits both parallel and numerical scalabilities [2]. In this paper we combine our optimal algorithms for the solution of bound and equality constrained problems with geometric and material non-linearities. Our computational results show that the good convergence properties of the time independent TFETI are preserved in the time dependent case and that the method exhibits parallel scalability. Numerical experiments were carried out with our in-house general purpose finite element package PMD [3]. They included solutions to various dynamic problems with non-linear effects computed in parallel. Figures documenting the quality of solution and parallel scalability are shown. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|