Skip to main content

A Coarse Space to Remove the Logarithmic Dependency in Neumann–Neumann Methods

  • Conference paper
  • First Online:

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

Abstract

Domain Decomposition Methods are the most widely used methods for solving large linear systems that arise from the discretization of partial differential equations.

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

Buying options

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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Learn about institutional subscriptions

Notes

  1. 1.

    Notable exceptions are the time dependent wave equation with finite speed of propagation [9], and the Laplace equation in certain molecular simulations with specific geometry [2, 3].

  2. 2.

    For N = 2 the structure of T(m, H) is not the same since there are no inner subdomains.

References

  1. F. Chaouqui, M.J. Gander, K. Santugini-Repiquet, A continuous analysis of Neumann-Neumann methods: scalability and new coarse spaces (2018, in preparation)

    Google Scholar 

  2. G. Ciaramella, M. Gander, Analysis of the parallel Schwarz method for growing chains of fixed-size subdomains: part I. SIAM J. Numer. Anal. 55(3), 1330–1356 (2017)

    Article  MathSciNet  Google Scholar 

  3. G. Ciaramella, M. Gander, Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains: part II. SIAM J. Numer. Anal. 56(3), 1498–1524 (2018)

    Article  MathSciNet  Google Scholar 

  4. Y.H. De Roeck, P. Le Tallec, Analysis and test of a local domain decomposition preconditioner, in Fourth International Symposium on Domain Decomposition Methods for Partial Differential Equations, vol. 4 (1991)

    Google Scholar 

  5. M. Dryja, O. Widlund, An additive variant of the Schwarz alternating method for the case of many subregions. Ultracomputer Research Laboratory, Univ., Courant Inst. of Mathematical Sciences, Division of Computer Science (1987)

    Google Scholar 

  6. M. Dryja, O.B. Widlund, Additive Schwarz methods for elliptic finite element problems in three dimensions. New York University. Courant Institute of Mathematical Sciences. Computer Science Department (1991)

    MATH  Google Scholar 

  7. C. Farhat, M. Lesoinne, P. LeTallec, K. Pierson, D. Rixen, FETI-DP: a dual–primal unified FETI method part i: a faster alternative to the two-level FETI method. Int. J. Numer. Methods Eng. 50(7), 1523–1544 (2001)

    Article  Google Scholar 

  8. M.J. Gander, A. Loneland, SHEM: an optimal coarse space for RAS and its multiscale approximation, in Domain Decomposition Methods in Science and Engineering XXIII (Springer, Berlin, 2016)

    Google Scholar 

  9. M.J. Gander, L. Halpern, F. Nataf, Optimal Schwarz waveform relaxation for the one dimensional wave equation. SIAM J. Numer. Anal. 41(5), 1643–1681 (2003)

    Article  MathSciNet  Google Scholar 

  10. M.J. Gander, L. Halpern, K. Santugini-Repiquet, A new coarse grid correction for ras/as, in Domain Decomposition Methods in Science and Engineering XXI (Springer, Berlin, 2014), pp. 275–283

    MATH  Google Scholar 

  11. M.J. Gander, A. Loneland, T. Rahman, Analysis of a new harmonically enriched multiscale coarse space for domain decomposition methods (2015). Preprint arXiv:1512.05285

    Google Scholar 

  12. J. Mandel, M. Brezina, Balancing domain decomposition for problems with large jumps in coefficients. Math. Comput. Am. Math. Soc. 65(216), 1387–1401 (1996)

    Article  MathSciNet  Google Scholar 

  13. J. Mandel, C.R. Dohrmann, Convergence of a balancing domain decomposition by constraints and energy minimization. Numer. Linear Algebra Appl. 10(7), 639–659 (2003)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. R.A. Nicolaides, Deflation of conjugate gradients with applications to boundary value problems. SIAM J. Numer. Anal. 24(2), 355–365 (1987)

    Article  MathSciNet  Google Scholar 

  16. A. Toselli, O.B. Widlund, Domain Decomposition Methods: Algorithms and Theory, vol. 34 (Springer, Berlin, 2005)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Faycal Chaouqui , Martin J. Gander or Kévin Santugini-Repiquet .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chaouqui, F., Gander, M.J., Santugini-Repiquet, K. (2018). A Coarse Space to Remove the Logarithmic Dependency in Neumann–Neumann Methods. In: Bjørstad, P., et al. Domain Decomposition Methods in Science and Engineering XXIV . DD 2017. Lecture Notes in Computational Science and Engineering, vol 125. Springer, Cham. https://doi.org/10.1007/978-3-319-93873-8_13

Download citation

Publish with us

Policies and ethics