Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation ki

  • Maksymilian Dryja
  • Olof Widlund
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 55)


We design and analyze Neumann-Neumann (N-N) algorithms for elliptic problems imposed in the 2-D polygonal region Ω with discontinuous coefficients on fine triangulation. We first discuss the two-level N-N algorithm and then we extend it to three levels.


Space Versus Elliptic Problem Domain Decomposition Harmonic Extension Schwarz Method 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Dryja and O. B. Widlund, Schwarz methods of Neumann-Neumann type for three-dimensional elliptic finite element problems, Comm. Pure Appl. Math., 48 (1995), pp. 121–155.zbMATHCrossRefGoogle Scholar
  2. 2.
    J. Mandel and M. Brezina, Balancing domain decomposition for problems with large jumps in coeffcients, Math. Comp., 65 (1996), pp. 1387–1401.zbMATHCrossRefGoogle Scholar
  3. 3.
    B. F. Smith, P. E. Bjørstad, and W. Gropp, Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations, Cambridge University Press, 1996.Google Scholar
  4. 4.
    A. Toselli and O. B. Widlund, Domain Decomposition Methods - Algorithms and Theory, vol. 34 of Series in Computational Mathematics, Springer, 2005.Google Scholar

Copyright information

© Springer 2007

Authors and Affiliations

  • Maksymilian Dryja
    • 1
  • Olof Widlund
    • 2
  1. 1.Department of Mathematics, Informatics and MechanicsWarsaw UniversityWarsawPoland
  2. 2.Courant Institute of Mathematical SciencesNew York UniversityNew YorkUSA

Personalised recommendations