A Dirichlet-Neumann algorithm for mortar saddle point problems
algorithmconjugate gradient methodconvergenceDirichlet-Neumann algorithmfinite element methodmorter FEMsaddle-point problemsecond order elliptic problems
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
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.
- A multigrid method for saddle point problems arising from mortar finite element discretizations
- A Multigrid Algorithm for the Mortar Finite Element Method
- A Neumann-Neumann algorithm for a mortar finite element discretization of fourth-order elliptic problems in 2D
- Neumann-Neumann algorithms for a mortar Crouzeix-Raviart element for 2nd order elliptic problems
- Efficient iterative solvers for elliptic finite element problems on nonmatching grids
This page was built for publication: A Dirichlet-Neumann algorithm for mortar saddle point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860946)
