A fast and robust iterative solver for nonlinear contact problems using a primal-dual active set strategy and algebraic multigrid

For extending the usability of implicit FE codes for large-scale forming simulations, the computation time has to be decreased dramatically. In principle this can be achieved by using iterative solvers. In order to facilitate the use of this kind of solvers, one needs a contact algorithm which does not deteriorate the condition number of the system matrix and therefore does not slow down the convergence of iterative solvers like penalty formulations do. Additionally, an algorithm is desirable which does not blow up the size of the system matrix like methods using standard Lagrange multipliers. The work detailed in this paper shows that a contact algorithm based on a primal-dual active set strategy provides these advantages and therefore is highly efficient with respect to computation time in combination with fast iterative solvers, especially algebraic multigrid methods. Copyright (c) 2006 John Wiley & Sons, Ltd.