Skip to main content
SpringerLink
Log in

Domain Decomposition Methods for Elliptic Partial Differential Equations

  • Chapter
Error Control and Adaptivity in Scientific Computing

Part of the book series: NATO Science Series ((ASIC,volume 536))

Abstract

These lecture notes concerns the iterative solution, by domain decomposition methods, of the often huge linear system of algebraic equations which arise when elliptic problems are discretized by finite elements. These algorithms are preconditioned conjugate gradient methods, or more generally, preconditioned Krylov space methods, where the preconditioner is constructed from smaller instances of a given discrete elliptic problem, typically defined by restricting the domain of definition to many small subregions of the given region on which the elliptic problem is defined. These algorithms are designed with parallel computing in mind.

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 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
Hardcover Book
USD 109.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. Balay, S., W. Gropp, L. C. McInnes, and B. F. Smith: 1998, ‘TETSc, the Portable, Extensible Toolkit for Scientific Computation’. Argonne National Laboratory, 2.0.22 April 29, 1998 edition.

    Google Scholar 

  2. Bică, I.: 1997, ‘Iterative Substructuring Algorithms for the p-version Finite Element Method for Elliptic Problems’. Ph.D. thesis, Courant Institute of Mathematical Sciences. Tech. Rep. 743, Department of Computer Science, Courant Institute.

    Google Scholar 

  3. Bramble, J. H.: 1966, ‘A second order finite difference analogue of the first biharmonic boundary value problem’. Numer. Math. 9, 236–249.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bramble, J. H.: 1993, Multigrid Methods. Burnt Mill, Harlow, Essex CM20 2JE, England: Longman Scientific & Technical. Pitman Research Notes in Mathematics Series #294.

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Bramble, J. H., J. E. Pasciak, J. Wang, and J. Xu: 1991, ‘Convergence Estimates for Product Iterative Methods with Applications to Domain Decomposition’. Math. Comp. 57(195), 1–21.

    Article  MathSciNet  MATH  Google Scholar 

  7. Bramble, J. H., J. E. Pasciak, and J. Xu: 1990, ‘Parallel Multilevel Preconditioners’. Math. Comp. 55, 1–22.

    Article  MathSciNet  MATH  Google Scholar 

  8. Brenner, S. C.: 1998, ‘Lower Bounds of Two-level Additive Schwarz Preconditinoners with Small Overlap’. Technical Report 1998:01, The University of South Carolina, Department of Mathematics.

    Google Scholar 

  9. Brenner, S. C. and L. R. Scott: 1994, The Mathematical Theory of Finite Element Methods. Berlin: Springer-Verlag.

    MATH  Google Scholar 

  10. Cai, X.-C.: 1993, ‘An Optimal Two-level Overlapping Domain Decomposition Method for Elliptic Problems in Two and Three Dimensions’. SIAM J. Sci. Comp. 14, 239–247.

    Article  MATH  Google Scholar 

  11. Cai, X.-C. and O. Widlund: 1992, ‘Domain Decomposition Algorithms for Indefinite Elliptic Problems’. SIAM J. Sci. Statist. Comput. 13(1), 243–258.

    Article  MathSciNet  MATH  Google Scholar 

  12. Cai, X.-C. and O. Widlund: 1993, ‘Multiplicative Schwarz Algorithms for Some Nonsymmetric and Indefinite Problems’. SIAM J. Numer. Anal. 30(4), 936–952.

    Article  MathSciNet  MATH  Google Scholar 

  13. Casarin, M. A.: 1996, ‘Schwarz Preconditioners for Spectral and Mortar Finite Element Methods with Applications to Incompressible Fluids’. Ph.D. thesis, Courant Institute of Mathematical Sciences. Tech. Rep. 717, Department of Computer Science, Courant Institute.

    Google Scholar 

  14. Casarin, M. A.: 1997, ‘Quasi-Optimal Schwarz Methods for the Conforming Spectral Element Discretization’. SIAM J. Numer. Anal. 34(6), 2482–2502.

    Article  MathSciNet  MATH  Google Scholar 

  15. Dryja, M., B. F. Smith, and O. B. Widlund: 1994, ‘Schwarz Analysis of Iterative Substructuring Algorithms for Elliptic Problems in Three Dimensions’. SIAM J. Numer. Anal. 31(6), 1662–1694.

    Article  MathSciNet  MATH  Google Scholar 

  16. Dryja, M. and O. B. Widlund: 1990, ‘Towards a Unified Theory of Domain Decomposition Algorithms for Elliptic Problems’. In: T. Chan, R. Glowinski, J. Périaux, and O. Widlund (eds.): Third International Symposium on Domain Decomposition Methods for Partial Differential Equations, pp. 3–21.

    Google Scholar 

  17. Dryja, M. and O. B. Widlund: 1994, ‘Domain Decomposition Algorithms with Small Overlap’. SIAM J. Sci. Comput. 15(3), 604–620.

    Article  MathSciNet  Google Scholar 

  18. Dryja, M. and O. B. Widlund: 1995, ‘Schwarz Methods of Neumann-Neumann Type for Three-Dimensional Elliptic Finite Element Problems’. Comm. Pure Appl. Math. 48(2), 121–155.

    Article  MathSciNet  MATH  Google Scholar 

  19. Farhat, C. and F.-X. Roux: 1994, ‘Implicit parallel processing in structural mechanics’. In: J. T. Oden (ed.): Computational Mechanics Advances, Vol. 2 (1). North-Holland, pp. 1–124.

    Google Scholar 

  20. Golub, G. H. and C. F. V. Loan: 1996, Matrix Computations. Johns Hopkins Univ. Press. Third Edition.

    Google Scholar 

  21. Guo, B. and W. Cao: 1996, ‘A preconditioner for the h — p version of the finite element method in two dimensions’. Numer. Math. 75(1), 59–77.

    Article  MathSciNet  MATH  Google Scholar 

  22. Guo, B. and W. Cao: 1997a, ‘Additive Schwarz Methods for the h — p Version of the Finite Element Method in Two Dimensions’. SIAM J. Sci. Comput. 18(5), 1267–1288.

    Article  MathSciNet  MATH  Google Scholar 

  23. Guo, B. and W. Cao: 1997b, ‘An Iterative and Parallel Solver Based on Domain Decomposition of the h — p Version of the Finite Element Method’. J. Comp. Appl. Math. 83, 71–85.

    Article  MathSciNet  MATH  Google Scholar 

  24. Guo, B. and W. Cao: 1998, ‘An Additive Schwarz Method for the h — p Version of the Finite Element Method in Three Dimensions’. SIAM J. Numer. Anal. 35(2), 632–654.

    Article  MathSciNet  MATH  Google Scholar 

  25. Klawonn, A. and O. B. Widlund: 1999, ‘FETI and Neumann-Neumann Iterative Substructuring Methods: A Comparison and New Results’. Technical report, Computer Science Department, Courant Institute of Mathematical Sciences. To appear.

    Google Scholar 

  26. Le Tallec, P.: 1994, ‘Domain decomposition methods in computational mechanics’. In: J. T. Oden (ed.): Computational Mechanics Advances, Vol. 1(2). North-Holland, pp. 121–220.

    Google Scholar 

  27. Lions, P.-L.: 1988, ‘On the Schwarz alternating method. I.’. In: R. Glowinski, G. H. Golub, G. A. Meurant, and J. Périaux (eds.): First International Symposium on Domain Decomposition Methods for Partial Differential Equations. Philadelphia, PA, pp. 1–42.

    Google Scholar 

  28. Mandel, J.: 1993, ‘Balancing Domain Decomposition’. Comm. Numer. Meth. Engrg. 9, 233–241.

    Article  MathSciNet  MATH  Google Scholar 

  29. Mandel, J. and M. Brezina: 1996, ‘Balancing Domain Decomposition for Problems with Large Jumps in Coefficients’. Math. Comp. 65, 1387–1401.

    Article  MathSciNet  MATH  Google Scholar 

  30. Oswald, P.: 1992, ‘On Discrete Norm Estimates Related to Multilevel Preconditioners in the Finite Element Method’. In: K. Ivanov and B. Sendov (eds.): Proc. Int. Conf. Constructive Theory of Functions, Varna 91. pp. 203–241.

    Google Scholar 

  31. Oswald, P.: 1994, Multilevel Finite Element Approximation, Theory and Applications, Teubner Skripten zur Numerik. Stuttgart: B.G. Teubner.

    Book  MATH  Google Scholar 

  32. Pavarino, L. F.: 1997, ‘Neumann-Neumann algorithms for spectral elements in three dimensions’. RAIRO Mathematical Modelling and Numerical Analysis 31, 471–493.

    MathSciNet  MATH  Google Scholar 

  33. Pavarino, L. F. and O. B. Widlund: 1996, ‘A Polylogarithmic Bound for an Iterative Substructuring Method for Spectral Elements in Three Dimensions’. SIAM J. Numer. Anal 33(4), 1303–1335.

    Article  MathSciNet  MATH  Google Scholar 

  34. Pavarino, L. F. and O. B. Widlund: 1997a, ‘Iterative Substructuring Methods for Spectral Element Discretizations of Elliptic Systems. II: Mixed Methods for Linear Elasticity and Stokes Flow’. Technical Report 755, Dept. of Computer Science, Courant Institute of Mathematical Sciences.

    Google Scholar 

  35. Pavarino, L. F. and O. B. Widlund: 1997b, ‘Iterative Substructuring Methods for Spectral Elements: Problems in Three Dimensions Based on Numerical Quadrature’. Computers Math. Applic. 33(1/2), 193–209.

    Article  MathSciNet  MATH  Google Scholar 

  36. Pavarino, L. F. and O. B. Widlund: 1999, ‘Iterative Substructuring Methods for Spectral Element Discretizations of Elliptic Systems. I: Compressible Linear Elasticity’. SIAM J. Numer. Anal. To appear.

    Google Scholar 

  37. Quarteroni, A. and A. Valli: 1999, Domain Decomposition Methods for Partial Differential Equations. Oxford Science Publications.

    Google Scholar 

  38. Saad, Y. and M. H. Schultz: 1986, ‘GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems’. SIAM J. Sci. Stat. Comp. 7, 856–869.

    Article  MathSciNet  MATH  Google Scholar 

  39. Schwarz, H. A.: 1890, Gesammelte Mathematische Abhandlungen, Vol. 2, pp. 133–143. Berlin: Springer. First published in Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich, volume 15, 1870, pp. 272-286.

    Book  MATH  Google Scholar 

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

    Google Scholar 

  41. Toselli, A.: 1997, ‘Overlapping Schwarz Methdos for Maxwell’s Equations in Three Dimensions’. Technical Report 736, Department of Computer Science, Courant Institute.

    Google Scholar 

  42. Toselli, A., O. B. Widlund, and B. I. Wohlmuth: 1998, ‘An Iterative Substructuring Method for Maxwell’s Equations in Two Dimensions’. Technical Report 768, Department of Computer Science, Courant Institute.

    Google Scholar 

  43. Widlund, O. B.: 1988, ‘Iterative Substructuring Methods: Algorithms and Theory for Elliptic Problems in the Plane’. In: R. Glowinski, G. H. Golub, G. A. Meurant, and J. Périaux (eds.): First International Symposium on Domain Decomposition Methods for Partial Differential Equations. Philadelphia, PA.

    Google Scholar 

  44. Wohlmuth, B. I., A. Toselli, and O. B. Widlund: 1998, ‘Iterative Substructuring Method for Raviart-Thomas Vector Fields in Three Dimensions’. Technical Report 775, Department of Computer Science, Courant Institute.

    Google Scholar 

  45. Xu, J. and J. Zou: 1998, ‘Some Nonoverlapping Domain Decomposition Methods’. SIAM Review 40, 857–914.

    Article  MathSciNet  MATH  Google Scholar 

  46. Yserentant, H.: 1986, ‘On the Multi-Level Splitting of Finite Element Spaces’. Numer. Math. 49, 379–412.

    Article  MathSciNet  MATH  Google Scholar 

  47. Zhang, X.: 1991, ‘Studies in Domain Decomposition: Multilevel Methods and the Biharmonic Dirichlet Problem’. Ph.D. thesis, Courant Institute, New York University.

    Google Scholar 

  48. Zhang, X.: 1992, ‘Multilevel Schwarz Methods’. Numer. Math. 63(4), 521–539.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, 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

Editor information

Editors and Affiliations

  1. Research Center of Applied Mathematics, Selcuk University, Konya, Turkey

    Haydar Bulgak

  2. Institut für Informatik, Technische Universität München, D-80290, München, Germany

    Christoph Zenger

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Widlund, O.B. (1999). Domain Decomposition Methods for Elliptic Partial Differential Equations. In: Bulgak, H., Zenger, C. (eds) Error Control and Adaptivity in Scientific Computing. NATO Science Series, vol 536. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4647-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-4647-0_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-0-7923-5809-1

  • Online ISBN: 978-94-011-4647-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation