Scientific article
OA Policy
English

Cross-points in the Dirichlet-Neumann method I: well-posedness and convergence issues

Published inNumerical algorithms, vol. 92, no. 1, p. 301-334
Publication date2022-11-08
First online date2022-11-08
Abstract

Cross-points in domain decomposition, i.e., points where more than two subdomains meet, have received substantial attention over the past years, since domain decomposition methods often need special attention in their definition at cross-points, in particular if the transmission conditions of the domain decomposition method contain derivatives, like in the Dirichlet-Neumann method. We study here for the first time the convergence of the Dirichlet-Neumann method at the continuous level in the presence of cross-points. We show that its iterates can be uniquely decomposed into two parts, an even symmetric part that converges geometrically, like when there are no cross-points present, and an odd symmetric part, which generates a singularity at the cross-point and is not convergent. We illustrate our analysis with numerical experiments.

Citation (ISO format)
CHAUDET, Bastien, GANDER, Martin Jakob. Cross-points in the Dirichlet-Neumann method I: well-posedness and convergence issues. In: Numerical algorithms, 2022, vol. 92, n° 1, p. 301–334. doi: 10.1007/s11075-022-01445-1
Main files (1)
Article (Published version)
accessLevelPublic
Identifiers
Additional URL for this publicationhttps://link.springer.com/10.1007/s11075-022-01445-1
Journal ISSN1017-1398
58views
348downloads

Technical informations

Creation03/04/2023 13:02:53
First validation05/04/2023 13:50:21
Update05/04/2023 13:50:21
Status update05/04/2023 13:50:21
Last indexation01/11/2024 04:43:32
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack