In numerical analysis, mortar methods are discretization methods for partial differential equations, which use separate finite element discretization on nonoverlapping subdomains. The meshes on the subdomains do not match on the interface, and the equality of the solution is enforced by Lagrange multipliers, judiciously chosen to preserve the accuracy of the solution.[1][2] Mortar discretizations lend themselves naturally to the solution by iterative domain decomposition methods such as FETI and balancing domain decomposition[3][4][5][6] In the engineering practice in the finite element method, continuity of solutions between non-matching subdomains is implemented by multiple-point constraints.

References

  1. ↑ Y. Maday, C. Mavriplis, and A. T. Patera, Nonconforming mortar element methods: application to spectral discretizations, in Domain decomposition methods (Los Angeles, CA, 1988), SIAM, Philadelphia, PA, 1989, pp. 392--418.
  2. ↑ B. I. Wohlmuth, A mortar finite element method using dual spaces for the Lagrange multiplier, SIAM J. Numer. Anal., 38 (2000), pp. 989--1012.
  3. ↑ M. Dryja, A Neumann-Neumann algorithm for a mortar discretization of elliptic problems with discontinuous coefficients, Numer. Math., 99 (2005), pp. 645--656.
  4. ↑ L. Marcinkowski, Domain decomposition methods for mortar finite element discretizations of plate problems, SIAM J. Numer. Anal., 39 (2001), pp. 1097--1114 (electronic).
  5. ↑ D. Stefanica, Parallel FETI algorithms for mortars, Appl. Numer. Math., 54 (2005), pp. 266--279.
  6. ↑ G. Pencheva and I. Yotov, Balancing domain decomposition for mortar mixed finite element methods, Numer. Linear Algebra Appl., 10 (2003), pp. 159--180. Dedicated to the 60th birthday of Raytcho Lazarov.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.