Advertisement

A FETI - DP Method for a Mortar Discretization of Elliptic Problems

  • Maksymilian Dryja
  • Olof B. Widlund
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 23)

Abstract

In this paper, an iterative substructuring method with Lagrange multipliers is proposed for discrete problems arising from approximation of elliptic problem in two dimensions on non-matching meshes. The problem is formulated using a mortar technique. The algorithm belongs to the family of dual-primal FETI (Finite Element Tearing and Interconnecting) methods which has been analyzed recently for discretization on matching meshes. In this method the unknowns at the vertices of substructures are eliminated together with those of the interior nodal points of these substructures. It is proved that the preconditioner proposed is almost optimal; it is also well suited for parallel computations.

Keywords

Block Diagonal Matrix Piecewise Linear Continuous Function Iterative Substructuring Method Mortar Element Method Mortar Side 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ben Belgacem, F. (1999) The mortar finite element method with Lagrange multipliers. Numer. Math. 84, 173–197zbMATHGoogle Scholar
  2. 2.
    Bernardi, C, Maday, Y., Patera, A. T. (1989) A new nonconforming approach to domain decomposition. The mortar element method. College de Prance Seminar, H. Brezis and J. L. Lions, eds., Pitman.Google Scholar
  3. 3.
    Farhat, C, Lesoinne, M., Pierson, K. (2000) A scalable dual - primal domain decomposition. Numer. Lin. Alg. App. Vol. 7(7–8), 687–714MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Klawonn, A., Widlund, O. (2001) FETI and Neumann - Neumann iterative sub-structuring methods: Connections and new results. Comm. Pure. Appl. Math. 54, 57–90MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Klawonn, A., Widlund, O., Dryja, M. (2001) Dual-primal FETI methods for three-dimensional elliptic problems with heterogeneous coefficients. Technical report 2001-815, Computer Science Department, Courant Institute of Mathematical SciencesGoogle Scholar
  6. 6.
    Mandel, J., Tezaur, R. (2001) On the convergence of a dual-primal substructuring method. Numer. Math. 88:3, 543–558MathSciNetCrossRefGoogle Scholar
  7. 7.
    Peisker, P. (1988) On the numerical solution of the first biharmönic equation. MAN Mathematical Modelling and Numerical Analysis, 22, #4, 655–676MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Maksymilian Dryja
    • 1
  • Olof B. Widlund
    • 2
  1. 1.Warsaw University, WarsawWarsawPoland
  2. 2.Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA

Personalised recommendations