A Dirichlet-Neumann algorithm for mortar saddle point problems (Q1860946): Difference between revisions

This paper deals with an approximation of second order elliptic problems by the finite element method (FEM) on a nonmatching triangulation. The discrete problem obtained, from the morter FEM is described and it is rewritten as a saddle-point problem. The goal of this paper is to design and analyze a Dirichlet-Neumann algorithm for solving the discrete problem when the original polygonal region \(\Omega\) is partitioned into many disjoint subregions \(\Omega_i\), assumed to be triangles or rectangles. The author uses a conjugate gradient method for solving the discrete problem. An implementation of the algorithm with its rate of convergence is presented.