Author:
Chaudet-Dumas Bastien,Gander Martin J.
Abstract
AbstractCross-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.
Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
University of Geneva
Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Schwarz, H.A.: Über einen Grenzübergang durch alternierendes Verfahren. Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich 15, 272–286 (1870)
2. Bjørstad, P.E., Widlund, O.B.: Iterative methods for the solution of elliptic problems on regions partitioned into substructures. SIAM J. Numer. Anal. 23(6), 1093–1120 (1986)
3. Bourgat, J.-F., Glowinski, R., Le Tallec, P., Vidrascu, M., Glowinski, R., Périaux, J., Widlund, O: Variational formulation and algorithm for trace operator in domain decomposition calculations. In: Chan, T. (ed.) Domain decomposition methods, pp 3–16, SIAM (1989)
4. Farhat, C., Roux, F.-X.: A method of Finite Element Tearing and Interconnecting and its parallel solution algorithm. Int. J. Numer. Meth. Engrg. 32, 1205–1227 (1991)
5. Toselli, A., Widlund, O.: Domain Decomposition Methods - Algorithms and Theory. Springer Series in Computational Mathematics, vol. 34. Springer (2004)