Skip to main content
SpringerLink
Log in

Accomodating Irregular Subdomains in Domain Decomposition Theory

  • Conference paper
  • First Online:
Domain Decomposition Methods in Science and Engineering XVIII

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 70))

Summary

In the theory for domain decomposition methods, it has previously often been assumed that each subdomain is the union of a small set of coarse shape-regular triangles or tetrahedra. Recent progress is reported, which makes it possible to analyze cases with irregular subdomains such as those produced by mesh partitioners. The goal is to extend the analytic tools so that they work for problems on subdomains that might not even be Lipschitz and to characterize the rates of convergence of domain decomposition methods in terms of a few, easy to understand, geometric parameters of the subregions. For two dimensions, some best possible results have already been obtained for scalar elliptic and compressible and almost incompressible linear elasticity problems; the subdomains should be John or Jones domains and the rates of convergence are determined by parameters that characterize such domains and that of an isoperimetric inequality. Technical issues for three dimensional problems are also discussed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Acosta, G., Durán, R.G., Muschietti, M. A.: Solutions of the divergence operator on John domains. Adv. Math., 206(2):373–401, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  2. Astrahancev, G.P.: The method of fictitious domains for a second order elliptic equation with natural boundary conditions. Ž. Vyvcisl. Mat. i Mat. Fiz. 18 (1978), no. 1, 118–125; trans. Comput. Math. Math. Phys., 18:114–121, 1978.

    MATH  MathSciNet  Google Scholar 

  3. Bojarski, B.: Remarks on Sobolev imbedding inequalities. In Complex analysis, Joensuu 1987, 52–68. Lecture Notes in Math., 1351. Springer, Berlin, 1988.

    Google Scholar 

  4. Bramble, J.H.: A proof of the inf-sup condition for the Stokes equations on Lipschitz domains. Math. Models Meth. Appl. Sci., 13(3):361–371, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  5. Bramble, J.H., Pasciak, J.E., Schatz, A.H.: The construction of preconditioners for elliptic problems by substructuring. I. Math. Comp., 47(175):103–134, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  6. Brenner, S.C., Scott, R.: The Mathematical Theory of Finite Element Methods, 2nd ed. Springer, Berlin–Heidelberg–New York, 2002.

    MATH  Google Scholar 

  7. Buckley, S., Koskela, P.: Sobolev-Poincaré implies John. Math. Res. Lett., 2:577–593, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  8. Dohrmann, C.R., Klawonn, A., Widlund, O.B.: Extending theory for domain decomposition algorithms to irregular subdomains. In U. Langer et al. eds., Domain Decompostion Methods in Science and Engineeering XVII, 255–261. Lect. Notes Comput. Sci. Eng., 60. Springer, 2007.

    Google Scholar 

  9. Dohrmann, C.R., Klawonn, A., Widlund, O.B.: A family of energy minimizing coarse spaces for overlapping Schwarz preconditioners. In U. Langer et al. eds., Domain Decomposition Methods in Science and Engineering XVII, 247–254. Lect. Notes Comput. Sci. Eng., 60. Springer, 2007.

    Google Scholar 

  10. Dohrmann, C.R., Klawonn, A., Widlund, O.B.: Domain decomposition for less regular subdomains: Overlapping Schwarz in two dimensions. SIAM J. Numer. Anal., 46(4):2153–2168, 2008.

    Article  MATH  MathSciNet  Google Scholar 

  11. Dohrmann, C.R., Widlund, O.B.: A hybrid domain decomposition method for compressible and almost incompressible elasticity. TR2008-919, Courant Institute of Mathematical Sciences, December 2008.

    Google Scholar 

  12. Dohrmann, C.R., Widlund, O.B.: An overlapping Schwarz algorithm for almost incompressible elasticity. TR2008-912, Dept. Computer Science, Courant Institute of Mathematical Sciences, New York University, May 2008.

    Google Scholar 

  13. Dryja, M., Widlund, O.B.: Some domain decomposition algorithms for elliptic problems. In L. Hayes and D. Kincaid, eds., Iterative Methods for Large Linear Systems, 273–291. Academic, 1989.

    Google Scholar 

  14. Durán, R.G., Muschietti, M. A.: The Korn inequality for Jones domains. Electron. J. Differential Equations, 2004(127):1–10, 2004.

    Google Scholar 

  15. Federer, H., Fleming, W.H.: Normal and integral currents. Ann. of Math. (2), 72:458–520, 1960.

    Article  MATH  MathSciNet  Google Scholar 

  16. Hajłasz, P.: Sobolev inequalities, truncation method, and John domains. In Papers on analysis, 109–126. Rep. Univ. Jyväskylä Dep. Math. Stat., 83. Univ. Jyväskylä, Jyväskylä, 2001.

    Google Scholar 

  17. Jones, P. W.: Quasiconformal mappings and extendability of functions in Sobolev space. Acta Math., 147(1-2):71–88, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  18. Karypis, G., Kumar, V.: METIS Version 4.0. University of Minnesota, Department of Computer Science, Minneapolis, MN, 1998.

    Google Scholar 

  19. Klawonn, K., Pavarino, L. F.: Overlapping Schwarz methods for mixed linear elasticity and Stokes problems. Comput. Methods Appl. Mech. Engrg., 165:233–245, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  20. Klawonn, A., Pavarino, L. F.: A comparison of overlapping Schwarz methods and block preconditioners for saddle point problems. Numer. Linear Algebra Appl., 7:1–25, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  21. Klawonn, A., Rheinbach, O.: A parallel implementation of Dual-Primal FETI methods for three dimensional linear elasticity using a transformation of basis. SIAM J. Sci. Comput., 28(5):1886–1906, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  22. Klawonn, A., Rheinbach, O. Robust FETI-DP methods for heterogeneous three dimensional elasticity problems. Comput. Methods Appl. Mech. Engrg., 196(8):1400–1414, 2007.

    Article  MATH  MathSciNet  Google Scholar 

  23. Klawonn, A., Rheinbach, O., Widlund, O.B.: An analysis of a FETI–DP algorithm on irregular subdomains in the plane. SIAM J. Numer. Anal., 46(5):2484–2504, 2008.

    Article  MATH  MathSciNet  Google Scholar 

  24. Klawonn, A., Widlund, O.B.: Dual-Primal FETI Methods for Linear Elasticity. Comm. Pure Appl. Math., 59:1523–1572, 2006.

    Article  MATH  MathSciNet  Google Scholar 

  25. Klawonn, A., Widlund, O.B., Dryja, M.: Dual-primal FETI methods for three-dimensional elliptic problems with heterogeneous coefficients. SIAM J. Numer. Anal., 40(1):159–179, April 2002.

    Article  MATH  MathSciNet  Google Scholar 

  26. Li, J., Widlund, O.B.: FETI–DP, BDDC, and Block Cholesky Methods. Internat. J. Numer. Methods Engrg., 66(2):250–271, 2006.

    Article  MathSciNet  Google Scholar 

  27. Mandel, J., Dohrmann, C.R., Tezaur, R.: An algebraic theory for primal and dual substructuring methods by constraints. Appl. Numer. Math., 54:167–193, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  28. Maz’ja, V.G.: Classes of domains and imbedding theorems for function spaces. Soviet Math. Dokl., 1: 882–885, 1960.

    MathSciNet  Google Scholar 

  29. Nečas, J. Les méthodes directes en théorie des équations elliptiques. Academia, Prague, 1967.

    MATH  Google Scholar 

  30. Scott, L.R., Zhang, S.: Finite element interpolation of nonsmooth functions satisfying boundary conditions. Math. Comp., 54(190):483–493, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  31. Toselli, A., Widlund, O.: Domain Decomposition Methods - Algorithms and Theory, Springer Series in Computational Mathematics, 34. Springer, Berlin–Heidelberg–New York, 2005.

    Google Scholar 

  32. Widlund, O.B.: An extension theorem for finite element spaces with three applications. In W. Hackbusch and K. Witsch, eds., Numerical Techniques in Continuum Mechanics, 110–122. Braunschweig/Wiesbaden, 1987. Notes on Numerical Fluid Mechanics, v. 16. Vieweg.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute, 251 Mercer Street, New York, NY, 10012, USA

    Olof B. Widlund

Authors
  1. Olof B. Widlund
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Olof B. Widlund .

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, The Hebrew University of Jerusalem, Ross Building - Givat Ram Campus, 91904, Jerusalem, Israel

    Michel Bercovier

  2. Section de mathématiques, Université de Genève, 2-4 rue du Lièvre, 1211, Genève 24, Switzerland

    Martin J. Gander

  3. Institut für Mathematik, Freie Universität Berlin, Arnimallee 6, 14195, Berlin-Dahlem, Germany

    Ralf Kornhuber

  4. Courant Institute, 251 Mercer Street, New York, NY, 10012, USA

    Olof Widlund

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Widlund, O.B. (2009). Accomodating Irregular Subdomains in Domain Decomposition Theory. In: Bercovier, M., Gander, M.J., Kornhuber, R., Widlund, O. (eds) Domain Decomposition Methods in Science and Engineering XVIII. Lecture Notes in Computational Science and Engineering, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02677-5_8

Download citation

Publish with us

Policies and ethics

Search

Navigation