Advertisement

A FETI-DP Formulation for Two-dimensional Stokes Problem on Nonmatching Grids

  • Hyea Hyun Kim
  • Chang-Ock Lee
Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 40)

Summary

We consider a FETI-DP formulation of the Stokes problem with mortar methods. To solve the Stokes problem correctly and efficiently, redundant continuity constraints are introduced. Lagrange multipliers corresponding to the redundant constraints are treated as primal variables in the FETI-DP formulation. We propose a preconditioner for the FETI-DP operator and show that the condition number of the preconditioned FETI-DP operator is bounded by C maxi=1,…,N {(1 + log (H i /h i ))2}, where H i and h i are the subdomain size and the mesh size, respectively, and C is a constant independent of H i and h i .

Keywords

Condition Number Elliptic Problem Stokes Problem Domain Decomposition Method Redundant Constraint 
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. C. Bernardi, Y. Maday, and A. T. Patera. A new nonconforming approach to domain decomposition: the mortar element method. In Nonlinear partial differential equations and their applications. Collège de France Seminar, Vol. XI (Paris, 1989–1991), volume 299 of Pitman Res. Notes Math. Ser., pages 13–51. Longman Sci. Tech., Harlow, 1994.MathSciNetGoogle Scholar
  2. J. H. Bramble and J. E. Pasciak. A domain decomposition technique for Stokes problems. Appl. Numer. Math., 6(4):251–261, 1990.MathSciNetCrossRefGoogle Scholar
  3. M. Dryja and O. B. Widlund. A FETI-DP method for a mortar discretization of elliptic problems. In Recent developments in domain decomposition methods (Züurich, 2001), volume 23 of Lect. Notes Comput. Sci. Eng., pages 41–52. Springer, Berlin, 2002.Google Scholar
  4. M. Dryja and O. B. Widlund. A generalized FETI-DP method for a mortar discretization of elliptic problems. In Domain decomposition methods in Science and Engineering (Cocoyoc, Mexico, 2002), pages 27–38. UNAM, Mexico City, 2003.Google Scholar
  5. C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, and D. Rixen. FETI-DP: a dual-primal unified FETI method. I. A faster alternative to the two-level FETI method. Internat. J. Numer. Methods Engrg., 50(7):1523–1544, 2001.MathSciNetCrossRefGoogle Scholar
  6. H. H. Kim and C.-O. Lee. A FETI-DP preconditioner for elliptic problems on nonmatching grids. In KAIST DAM Research Report 02-9. KAIST, 2002.Google Scholar
  7. A. Klawonn and O. B. Widlund. FETI and Neumann-Neumann iterative substructuring methods: connections and new results. Comm. Pure Appl.Math., 54(1):57–90, 2001.MathSciNetCrossRefGoogle Scholar
  8. J. Li. A dual-primal FETI method for incompressible Stokes equations. In Technical Report 816. Department of Computer Science, Courant Institute, New York Unversity, 2001.Google Scholar
  9. J. Mandel and R. Tezaur. On the convergence of a dual-primal substructuring method. Numer. Math., 88(3):543–558, 2001.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hyea Hyun Kim
    • 1
  • Chang-Ock Lee
    • 2
  1. 1.Division of Applied MathematicsKAISTDaejeonKorea
  2. 2.Division of Applied MathematicsKAISTKorea

Personalised recommendations