Scalable Total BETI based algorithm for 3D coercive contact problems of linear elastostatics

A Total BETI (TBETI) based domain decomposition algorithm with the preconditioning by a natural coarse grid of the rigid body motions is adapted for the solution of contact problems of linear elastostatics and proved to be scalable for the coercive problems, i.e., the cost of the solution is asymptotically proportional to the number of variables. The analysis is based on the original results by Langer and Steinbach on the scalability of BETI for linear problems and our development of optimal quadratic programming algorithms for bound and equality constrained problems. Both theoretical results and numerical experiments indicate a high efficiency of the algorithms presented