Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 101
PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by:
Paper 8
Parallel Implementation of the Total-FETI Domain Decomposition Method for the Solution of Elasto-Plastic Problems M. Merta and M. Cermák
Centre of Excellence IT4Innovations, VŠB-Technical University Ostrava, Czech Republic , "Parallel Implementation of the Total-FETI Domain Decomposition Method for the Solution of Elasto-Plastic Problems", in , (Editors), "Proceedings of the Third International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 8, 2013. doi:10.4203/ccp.101.8
Keywords: Total-FETI, elasto-plasticity, kinematic hardening, Trilinos.
Summary
Elasto-plastic processes describe the behaviour of solid continuum beyond reversible elastic deformations. They are typically described by hysteresis models with time memory
[1].
The rigorous mathematical analysis of elasto-plastic problems and the numerical methods for their solution started to appear in the late 1970s and in the early 1980s. Since then, many mathematical contributions to computational plasticity have been written
[2,3].
In this paper, we focus on the efficient parallel solution of elasto-plastic problems based on our implementation of the TFETI domain decomposition method in the Trilinos framework [4]. More specifically, we consider an associated elasto-plasticity with the von Mises plastic criterion and the kinematic hardening law [2,3,5]. The corresponding elasto-plastic constitutive model is discretized using the implicit Euler method in time and consequently a nonlinear stress-strain operator is implemented using the return mapping concept. This approach leads to the solution of a nonlinear variational equation with respect to the primal unknown displacement in each time step. By a finite element space discretization of the one time step problem, we obtain a system of nonlinear equations. The corresponding nonlinear operator is nondifferentiable but strongly semismooth. Therefore, the semismooth Newton method for solving the system is suitable because the strong semismoothness together with other properties ensures local quadratic convergence. In each Newton iteration, it is necessary to solve the respective linearized problem. The linear solver considered in this paper is based on a FETI type domain decomposition method enabling its efficient parallel implementation. The standard FETI method (FETI-1) was originally introduced by Farhat and Roux [6]. Here we use the Total-FETI (TFETI) variant, where also the Dirichlet boundary conditions are enforced by Lagrange multipliers [7]. Hence all subdomain stiffness matrices are singular with a-priori known kernels which is a great advantage in the numerical solution. With a known kernel basis we can regularize effectively the stiffness matrix without an extra fill in and use any standard sparse Cholesky type decomposition method for nonsingular matrices [8].
References
purchase the full-text of this paper (price £20)
go to the previous paper |
|