F Nous contacter

Multi angle

H 1 Multigrid and domain decomposition: similarities and differences

Auteurs : Gander, Martin (Auteur de la Conférence)
CIRM (Editeur )

    Loading the player...

    Résumé : Both multigrid and domain decomposition methods are so called optimal solvers for Laplace type problems, but how do they compare? I will start by showing in what sense these methods are optimal for the Laplace equation, which will reveal that while both multigrid and domain decomposition are iterative solvers, there are fundamental differences between them. Multigrid for Laplace’s equation is a standalone solver, while classical domain decomposition methods like the additive Schwarz method or Neumann-Neumann and FETI methods need Krylov acceleration to work. I will explain in detail for each case why this is so, and then also present modifications so that Krylov acceleration is not necessary any more. For overlapping methods, this leads to the use of partitions of unity, while for non-overlapping methods, the coarse space can be a remedy. Good coarse spaces in domain decomposition methods are very different from coarse spaces in multigrid, due to the very aggressive coarsening in domain decomposition. I will introduce the concept of optimal coarse spaces for domain decomposition in a sense very different from the optimal above, and then present approximations of this coarse space. Together with optimized transmission conditions, this leads to a two level domain decomposition method of Schwarz type which is competitive with multigrid for Laplace’s equation in wallclock time.

    Keywords : domain decomposition; multigrid

    Codes MSC :
    65F10 - Iterative methods for linear systems
    65N22 - Solution of discretized equations (BVP of PDE)
    65N55 - Multigrid methods; domain decomposition (BVP of PDE)

    Ressources complémentaires :

      Informations sur la Vidéo

      Réalisateur : Hennenfent, Guillaume
      Langue : Anglais
      Date de publication : 08/10/2019
      Date de captation : 19/09/2019
      Collection : Research talks ; Numerical Analysis and Scientific Computing
      Format : MP4
      Durée : 00:56:56
      Domaine : Numerical Analysis & Scientific Computing
      Audience : Chercheurs ; Doctorants , Post - Doctorants
      Download : https://videos.cirm-math.fr/2019-09-19_Gander.mp4

    Informations sur la rencontre

    Nom de la rencontre : Parallel Solution Methods for Systems Arising from PDEs / Méthodes parallèles pour la résolution de systèmes issus d'équations aux dérivées partielles
    Organisateurs de la rencontre : Dolean, Victorita ; Spillane, Nicole ; Szyld, Daniel
    Dates : 16/09/2019 - 20/09/2019
    Année de la rencontre : 2019
    URL Congrès : https://conferences.cirm-math.fr/2064.html

    Citation Data

    DOI : 10.24350/CIRM.V.19562203
    Cite this video as: Gander, Martin (2019). Multigrid and domain decomposition: similarities and differences. CIRM. Audiovisual resource. doi:10.24350/CIRM.V.19562203
    URI : http://dx.doi.org/10.24350/CIRM.V.19562203

    Voir aussi