期刊
VIETNAM JOURNAL OF MATHEMATICS
卷 46, 期 4, 页码 1053-1088出版社
SPRINGER SINGAPORE PTE LTD
DOI: 10.1007/s10013-018-0316-9
关键词
Domain-decomposition methods; Scalability; Classical and optimized Schwarz methods; Dirichlet-Neumann method; Neumann-Neumann method; Solvation model; Chain of atoms; Laplace's equation
类别
One-level domain-decomposition methods are in general not scalable, and coarse corrections are needed to obtain scalability. It has however recently been observed in applications in computational chemistry that the classical one-level parallel Schwarz method is surprizingly scalable for the solution of one- and two-dimensional chains of fixed-sized subdomains. We first review some of these recent scalability results of the classical one-level parallel Schwarz method, and then prove similar results for other classical one-level domain-decomposition methods, namely the optimized Schwarz method, the Dirichlet-Neumann method, and the Neumann-Neumann method. We show that the scalability of one-level domain decomposition methods depends critically on the geometry of the domain-decomposition and the boundary conditions imposed on the original problem. We illustrate all our results also with numerical experiments.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据