A dual iterative substructuring method with a penalty term

Abstract

An iterative substructuring method with Lagrange multipliers is considered for second order elliptic problems, which is a variant of the FETI-DP method. The standard FETI-DP formulation is associated with the saddle-point problem which is induced from the minimization problem with a constraint for imposing the continuity across the interface. Starting from the slightly changed saddle-point problem by addition of a penalty term with a positive penalization parameter eta, we propose a dual substructuring method which is implemented iteratively by the conjugate gradient method. In spite of the absence of any preconditioners, it is shown that the proposed method is numerically scalable in the sense that for a large value of eta, the condition number of the resultant dual problem is bounded by a constant independent of both the subdomain size H and the mesh size h. Computational issues and numerical results are presented.