Asynchronous optimized Schwarz methods with and without overlap

被引：34

作者：

Magoules, Frederic ^{[1
]}

Szyld, Daniel B. ^{[2
]}

Venet, Cedric ^{[1
]}

机构：

[1] Univ Paris Saclay, Cent Supelec, F-92295 Chatenay Malabry, France

[2] Temple Univ, Dept Math, 038-16,1805 N Broad St, Philadelphia, PA 19122 USA

来源：

NUMERISCHE MATHEMATIK | 2017年 / 137卷 / 01期

基金：

美国国家科学基金会;

关键词：

DOMAIN DECOMPOSITION METHODS; TRANSMISSION CONDITIONS; INTERFACE CONDITIONS; CONVERGENCE; EQUATIONS;

D O I：

10.1007/s00211-017-0872-z

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

An asynchronous version of the optimized Schwarz method for the solution of differential equations on a parallel computational environment is studied. In a one-way subdivision of the computational domain, with and without overlap, the method is shown to converge when the optimal artificial interface conditions are used. Convergence is also proved for the Laplacian operator under very mild conditions on the size of the subdomains, when approximate (non-optimal) interface conditions are utilized. Numerical results are presented on a large three-dimensional problem on modern parallel clusters and supercomputers illustrating the efficiency of the asynchronous approach.

引用

页码：199 / 227

页数：29

共 37 条

[1]

[Anonymous], DOMAIN DECOMPOSITION

[2]

[Anonymous], DOMAIN DECOMPOSITION

[3]

Argonne National Laboratory, 1993, TECHNICAL REPORT

[4]

Bahi J.M., 2008, Parallel iterative algorithms : from sequential to grid computing