Analysis of Patch Substructuring Methods

Authors:
Martin Gander;Laurence Halpern;Frédéric Magoulès;François-Xavier Roux
Affiliations:
Section de Mathématiques, Université de Genève, 1211 Genève, Switzerland;LAGA, Institut Galilée, Université Paris, 13 93430 Villetaneuse, France;Applied Mathematics and Systems Laboratory, Ecole Centrale Paris, 92295 Châtenay-Malabry Cedex, France;High Performance Computing Research Unit, ONERA, 92322 Chatillon, France
Venue:
International Journal of Applied Mathematics and Computer Science - Scientific Computation for Fluid Mechanics and Hyperbolic Systems
Year:
2007

Citing 4
Cited 3

Domain decomposition: parallel multilevel methods for elliptic partial differential equations

Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Optimal Discrete Transmission Conditions for a Nonoverlapping Domain Decomposition Method for the Helmholtz Equation

SIAM Journal on Scientific Computing
Optimized Schwarz Methods

SIAM Journal on Numerical Analysis

Speed-up the computing efficiency of waveform relaxation method for power system transient stability

Proceedings of the first international workshop on High performance computing, networking and analytics for the power grid
Efficient parallel implementation of the fully algebraic multiplicative Aitken-RAS preconditioning technique

Advances in Engineering Software
Reprint of Efficient parallel implementation of the fully algebraic multiplicative Aitken-RAS preconditioning technique

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Patch substructuring methods are non-overlapping domain decomposition methods like classical substructuring methods, but they use information from geometric patches reaching into neighboring subdomains, condensated on the interfaces, to enhance the performance of the method, while keeping it non-overlapping. These methods are very convenient to use in practice, but their convergence properties have not been studied yet. We analyze geometric patch substructuring methods for the special case of one patch per interface. We show that this method is equivalent to an overlapping Schwarz method using Neumann transmission conditions. This equivalence is obtained by first studying a new, algebraic patch method, which is equivalent to the classical Schwarz method with Dirichlet transmission conditions and an overlap corresponding to the size of the patches. Our results motivate a new method, the Robin patch method, which is a linear combination of the algebraic and the geometric one, and can be interpreted as an optimized Schwarz method with Robin transmission conditions. This new method has a significantly faster convergence rate than both the algebraic and the geometric one. We complement our results by numerical experiments.