WIT Press


Duality Based Domain Decomposition With Inexact Sub-problem Solver For Contact Problems

Price

Free (open access)

Paper DOI

10.2495/CON950541

Volume

7

Pages

8

Published

1995

Size

622 kb

Author(s)

Z. Dostal

Abstract

The dual Schur complement domain decomposition method introduced re- cently by Farhat and Roux [4] turned out to be an efficient algorithm for parallel solution of self-adjoint elliptic partial differential equations. In this paper, we combine this approach with the Polyak type algorithms in order to solve quadratic programming problems arising in the solution of unilateral contact problems of linear elasticity. The main feature of our new algorithm for the solution of coercive problems is that it accepts approximate solutions of auxiliary minimization problems and that it is able to drop and add many constraints whenever the active set is changed. The algorithm for the so- lution of semi-coercive problems is also presented. The performance of the algorithms is

Keywords