Z. Dostal et al., Solution of contact problems by FETI domain decomposition with natural coarse space projections, COMPUT METH, 190(13-14), 2000, pp. 1611-1627
Citations number
35
Categorie Soggetti
Mechanical Engineering
Journal title
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING
An efficient tron-overlapping domain decomposition algorithm of the Neumann
-Neumann type for solving both coercive and semicoercive contact problems i
s presented. The discretized problem is first turned by the duality theory
of convex programming to the quadratic programming problem with bound and e
quality constraints and the latter is further modified by means of orthogon
al projectors to the natural coarse space introduced by Farhat and Roux in
the framework of their FETI method. The resulting problem is then solved by
an augmented Lagrangian type algorithm with an outer loop for the Lagrange
multipliers for the equality constraints and an inner loop For the solutio
n of the bound constrained quadratic programming problems. The projectors a
re shown to guarantee fast convergence of iterative solution of auxiliary l
inear problems and to comply with efficient quadratic programming algorithm
s proposed earlier. Reported theoretical results and numerical experiments
indicate high numerical scalability of the algorithm which preserves the pa
rallelism of the FETI methods. (C) 2000 Elsevier Science B.V. All rights re
served.