### A multigrid method for saddle point problems arising from mortar finite element discretizations.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

Domain decomposition techniques provide a powerful tool for the numerical approximation of partial differential equations. We focus on mortar finite element methods on non-matching triangulations. In particular, we discuss and analyze dual Lagrange multiplier spaces for lowest order finite elements. These non standard Lagrange multiplier spaces yield optimal discretization schemes and a locally supported basis for the associated constrained mortar spaces. As a consequence, standard efficient iterative...

Domain decomposition techniques provide a flexible tool for the numerical approximation of partial differential equations. Here, we consider mortar techniques for quadratic finite elements in 3D with different Lagrange multiplier spaces. In particular, we focus on Lagrange multiplier spaces which yield optimal discretization schemes and a locally supported basis for the associated constrained mortar spaces in case of hexahedral triangulations. As a result, standard efficient iterative solvers as...

Domain decomposition techniques provide a flexible tool for the numerical approximation of partial differential equations. Here, we consider mortar techniques for quadratic finite elements in 3D with different Lagrange multiplier spaces. In particular, we focus on Lagrange multiplier spaces which yield optimal discretization schemes and a locally supported basis for the associated constrained mortar spaces in case of hexahedral triangulations. As a result, standard efficient iterative solvers...

**Page 1**