On Nilpotent Subdomain Iterations
On Nilpotent Subdomain Iterations
复制标题
DOI：
10.1007/978-3-319-52389-7_11
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
F. Chaouqui;M. Gander;K. Santugini-Repiquet
中科院分区：
文献类型：
--
作者：
F. Chaouqui;M. Gander;K. Santugini-Repiquet
Subdomain iterations which lead to a nilpotent iteration operator converge in a finite number of steps, and thus are equivalent to direct solvers. We determine in this paper for which type of decomposition and relaxation parameters Dirichlet-Neumann, Neumann-Neumann, and Optimal Schwarz methods can be nilpotent. We start using a simple one dimensional model problem, and show that Neumann-Neumann and Dirichlet-Neumann cannot lead to a nilpotent iteration matrix in general. Optimal Schwarz methods can be nilpotent for an arbitrary number of subdomains.
