Skip to main content

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

  • Conference paper
Recent Developments in Domain Decomposition Methods

Part of the book series: Lecture Notes in Computational Science and Engineering ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben Belgacem, F. (1999) The mortar finite element method with Lagrange multipliers. Numer. Math. 84, 173–197

    MATH  Google Scholar 

  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. Farhat, C, Lesoinne, M., Pierson, K. (2000) A scalable dual - primal domain decomposition. Numer. Lin. Alg. App. Vol. 7(7–8), 687–714

    Article  MathSciNet  MATH  Google Scholar 

  4. Klawonn, A., Widlund, O. (2001) FETI and Neumann - Neumann iterative sub-structuring methods: Connections and new results. Comm. Pure. Appl. Math. 54, 57–90

    Article  MathSciNet  MATH  Google Scholar 

  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 Sciences

    Google Scholar 

  6. Mandel, J., Tezaur, R. (2001) On the convergence of a dual-primal substructuring method. Numer. Math. 88:3, 543–558

    Article  MathSciNet  Google Scholar 

  7. Peisker, P. (1988) On the numerical solution of the first biharmönic equation. MAN Mathematical Modelling and Numerical Analysis, 22, #4, 655–676

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dryja, M., Widlund, O.B. (2002). A FETI - DP Method for a Mortar Discretization of Elliptic Problems. In: Pavarino, L.F., Toselli, A. (eds) Recent Developments in Domain Decomposition Methods. Lecture Notes in Computational Science and Engineering, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56118-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56118-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43413-9

  • Online ISBN: 978-3-642-56118-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics