Comparison of solvers for contact problems

Abstract

The paper focuses on the comparison of sequential solvers used for solving quadratic programming problems which have a wide variety of applications including contact modeling. The complex algebraic formulation generated from the contact problems may be reduced in some cases to fairly simple quadratic programming problem using dualization theory and can be effectively solved using different multigrid or domain decomposition based massively parallel solvers. In the paper, selected solvers are applied on benchmark problems and the achieved results are compared.