Article ID: | iaor20032501 |
Country: | Netherlands |
Volume: | 117 |
Issue: | 1 |
Start Page Number: | 117 |
End Page Number: | 129 |
Publication Date: | Nov 2002 |
Journal: | Annals of Operations Research |
Authors: | Friedlander A., Gomes F.A.M., Dostl Z., Santos S.A. |
Keywords: | programming: quadratic |
A non-overlapping domain decomposition algorithm of the Neumann–Neumann type for solving contact problems of elasticity is presented. Using the duality theory of convex programming, the discretized problem turns into a quadratic one with equality and bound constraints. The dual problem is modified by orthogonal projectors to the natural coarse space. The resulting problem is solved by an augmented Lagrangian algorithm. The projectors ensure an optimal convergence rate for the solution of the auxiliary linear problems by the preconditioned conjugate gradient method. Relevant aspects on the numerical linear algebra of these problems are presented, together with an efficient parallel implementation of the method.