zbMATH — the first resource for mathematics

Improved interface conditions for a non-overlapping domain decomposition of a nonconvex polygonal domain. (English) Zbl 1096.65124
Summary: We propose a local improvement of domain decomposition methods which fits with the singularities occurring in the solutions of elliptic equations in polygonal domains. This short presentation focuses on a model elliptic problem with the decomposition of a nonconvex polygonal domain into convex polygonal subdomains. After explaining the strategy and the theoretical design of adapted interface conditions at the corner, we present numerical experiments which show that these new interface conditions satisfy some optimality properties.

65N55 Multigrid methods; domain decomposition for boundary value problems involving PDEs
35J05 Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation
65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
Full Text: DOI
[1] Chniti, C.; Nataf, F.; Nier, F., Improved interface condition for 2D domain decomposition with corner: a theoretical determination · Zbl 1173.65364
[2] Japhet, C.; Nataf, F., The best interface conditions for domain decomposition methods: absorbing boundary conditions, (), 348-373
[3] Kondratiev, V.A., Boundary problems for elliptic equations in domains with conical or angular points, Trudy moskov. mat. obshch., 16, 209-292, (1967)
[4] F. Nier, Remarques sur les algorithmes de décomposition de domaines, in : Séminaire EDP de l’Ecole Polytechnique (1998-1999), Exposé numéro IX
[5] Quarteroni, A.; Valli, A., Domain decomposition methods for partial differential equations, (1999), Oxford Science Publications xxx · Zbl 0931.65118
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.