摘要
In this paper, based on the natural boundary reduction suggested by Feng and Yu, an overlapping domain decomposition method with its discretization is discussed. This method is very effective especially for problems over unbounded domains. The geometric convergency of both continuous and discrete problems is proved. The theoretical results as well as the numerical examples show that the convergence rate of this discrete Schwarz iteration is independent of the finite element mesh size, but dependent on the frequency of the exact solution and the overlapping degree of the subdomains.
In this paper, based on the natural boundary reduction suggested by Feng and Yu, an overlapping domain decomposition method with its discretization is discussed. This method is very effective especially for problems over unbounded domains. The geometric convergency of both continuous and discrete problems is proved. The theoretical results as well as the numerical examples show that the convergence rate of this discrete Schwarz iteration is independent of the finite element mesh size, but dependent on the frequency of the exact solution and the overlapping degree of the subdomains.
出处
《计算数学》
CSCD
北大核心
1998年第1期21-24,共4页
Mathematica Numerica Sinica
基金
国家自然科学基金!19701001
关键词
无界区域
区域分解
自然边界归化
边值问题
Unbounded Domain, Domain Decomposition, Natural Boundary Reduction
