Domain decomposition strategies with black box subdomain solvers


Séminaire Modèles et Algorithmes Déterministes: EDP-MOISE

19/05/2011 - 11:00 Mme Silvia Bertoluzza (CNR, Pavia, Italie) Salle 1 - Tour IRMA

Most domain decomposition methods imply the repeated solution of subdomain problems, that
consitute the bulk of the computation. Since extremely efficient optimized monodomain solvers are available in commercial/academic codes, it is desirable to have the possibility of using them directly in the solution process. Though many non conforming domain decomposition methods allow to use independent subdomain solvers, most of the times the coupling condition implies some modification for the corresponding code (al least in terms of input and/or output). We will discuss a theoretical strategy treating the subdomain solvers as black boxes and allowing to replace the subdomain solver with a simple call to a standard monodomain code.