%0 Journal Article %1 belgacem1999mortar %A Ben Belgacem, Faker %D 1999 %J Numerische Mathematik %K 35j05-laplacian-operator-helmholtz-poisson-equation 65n15-pdes-bvps-error-bounds 65n30-pdes-bvps-finite-elements 65n55-pdes-bvps-multigrid-methods-domain-decomposition %N 2 %P 173--197 %R 10.1007/s002110050468 %T The Mortar finite element method with Lagrange multipliers %U https://link.springer.com/article/10.1007%2Fs002110050468 %V 84 %X The present paper deals with a variant of a non conforming domain decomposition technique: the mortar finite element method. In the opposition to the original method this variant is never conforming because of the relaxation of the matching constraints at the vertices (and the edges in 3D) of subdomains. It is shown that, written under primal hybrid formulation, the approximation problem, issued from a discretization of a second order elliptic equation in 2D, is nonetheless well posed and provides a discrete solution that satisfies optimal error estimates with respect to natural norms. Finally the parallelization advantages consequence of this variant are also addressed.

@article{belgacem1999mortar, abstract = {The present paper deals with a variant of a non conforming domain decomposition technique: the mortar finite element method. In the opposition to the original method this variant is never conforming because of the relaxation of the matching constraints at the vertices (and the edges in 3D) of subdomains. It is shown that, written under primal hybrid formulation, the approximation problem, issued from a discretization of a second order elliptic equation in 2D, is nonetheless well posed and provides a discrete solution that satisfies optimal error estimates with respect to natural norms. Finally the parallelization advantages consequence of this variant are also addressed.}, added-at = {2021-12-29T00:19:59.000+0100}, author = {{Ben Belgacem}, Faker}, biburl = {https://www.bibsonomy.org/bibtex/22cc58fbcf765c18b965f61ba5277f1f3/gdmcbain}, day = 01, doi = {10.1007/s002110050468}, interhash = {96e452d994449cb7ac8ad109c56aa3e8}, intrahash = {2cc58fbcf765c18b965f61ba5277f1f3}, issn = {0945-3245}, journal = {Numerische Mathematik}, keywords = {35j05-laplacian-operator-helmholtz-poisson-equation 65n15-pdes-bvps-error-bounds 65n30-pdes-bvps-finite-elements 65n55-pdes-bvps-multigrid-methods-domain-decomposition}, month = dec, number = 2, pages = {173--197}, timestamp = {2021-12-29T00:20:44.000+0100}, title = {The Mortar finite element method with {L}agrange multipliers}, url = {https://link.springer.com/article/10.1007%2Fs002110050468}, volume = 84, year = 1999 }