A new approach is proposed for constructing nonoverlapping domain decomposition procedures for solving a linear system related to a nodal finite element method. It applies to problems involving either positive semi-definite or complex indefinite local matrices. The main feature of the method is to preserve the continuity requirements on the unknowns and the finite element equations at the nodes shared by more than two subdomains and to suitably augment the local matrices. We prove that the corresponding algorithm can be seen as a converging iterative method for solving the finite element system and that it cannot break down. Each iteration is obtained by solving uncoupled local finite element systems posed in each subdomain and, in contrast to a strict domain decomposition method, is completed by solving a linear system whose unknowns are the degrees of freedom attached to the above special nodes.
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics