Skip to main content
SpringerLink
Log in

A Neumann-Neumann algorithm for a mortar discretization of elliptic problems with discontinuous coefficients

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

Neumann-Neumann algorithm have been well developed for standard finite element discretization of elliptic problems with discontinuous coefficients. In this paper, an algorithm of this kind is designed and analyzed for a mortar finite element discretization of problems in three dimensions. It is established that its rate of convergence is independent of the discretization parameters and jumps of coefficients between subregions. The algorithm is well suited for parallel computations.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Belgacem, F.B., Maday,Y.: The mortar element method for three dimensional finite elements. M2AN, 31, 289–302 (1997)

    Google Scholar 

  2. Bernardi, C., Maday, Y., Patera, A.T.: A new nonconforming approach to domain decomposition: the mortar method. In Nonlinear Partial Differential Equations and their Applications. College de France Seminar, H. Brezis and J.- L. Lions, eds., Pitman Research Notes in Mathematics, Longman, Harlow, 13–51 (1994)

  3. Braess, D., Dahmen, W.: Stability estimates of the mortar finite element method for 3 - dimensional problems. East-West J. Numer. Math., v. 6, 249–263 (1998)

    Google Scholar 

  4. Dryja, M.: An iterative substructuring method for elliptic mortar finite element problems with discontinuous coefficients. In: Domain Decomposition Method 10, The Tenth International Conference on Domain Decomposition Methods, 1997, Boulder CO, J. Mandel, Ch. Farhat and X.- C. Cai, eds., Contemporary Mathematics, 218, AMS, Providence, RI, 94–103 (1998)

  5. Dryja, M., Widlund, O.B.: Schwarz method of Neumann-Neumann type for three-dimensional elliptic finite element problems. Comm. Pure Appl. Math., 48, 121–155 (1995)

    Google Scholar 

  6. Dryja, M., Smith, B.F., Widlund, O.: Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions. SIAM J. Numer. Analysis, 31, 1662–1694 (1994)

    Google Scholar 

  7. Mandel, J., Brezina, M.: Balancing domain decomposition for problems with large jumps in coefficients. Math. Comp., 65, 1387–1401 (1996)

    Google Scholar 

  8. Toselli, A., Widlund, O.B.: Domain Decomposition Methods: Algorithms and Theory, Springer Verlag (2004), to appear

  9. Smith, B.F., Bjørstad, P.E., Gropp, W.D.: Domain Decomposition: Parallel Multilevel Methods for Partial Differential Equations, Cambridge University Press (1996)

  10. Wohlmuth, B.I.: Discretization Methods and Iterative Solvers Based on Domain Decomposition. Lecture Notes in Computational Science and Engineering, M. Griebel, D. E. Keyes, R. M. Nieminem, D. Roose and T. Schlick, eds., Spring-Verlag, Berlin (2001)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Maksymilian Dryja

Authors
  1. Maksymilian Dryja
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maksymilian Dryja.

Additional information

Mathematics Subject Classification (1991): 65N55, 65N10, 65N30, 65N22.

The work was supported in part by the U.S. Department of Energy under contract DE-FG02-92ER25127 and in part by Polish Science Foundation under grant 2P03A00524.

AcknowledgmentThe author would like to thank Olof Widlund for many fruitful discussions and valuable remarks and suggestions on how to improve the presentation of our results.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dryja, M. A Neumann-Neumann algorithm for a mortar discretization of elliptic problems with discontinuous coefficients. Numer. Math. 99, 645–656 (2005). https://doi.org/10.1007/s00211-004-0573-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00211-004-0573-2

Keywords

Search

Navigation