空间长条型无界区域的非重叠区域分解算法  

Non-overlapping domain decomposition algorithm for space long unbounded

作　　者：冯曼[1] 

机构地区：[1]宿州学院数学与统计学院,安徽宿州234000

出　　处：《安庆师范大学学报（自然科学版）》2017年第1期33-35,共3页Journal of Anqing Normal University(Natural Science Edition)

基　　金：宿州学院一般科研项目(2014yyb02);宿州学院省级大学生创新创业实践项目(AH201410379076)

摘　　要：本文主要研究了空间上一种长条型边界曲面外的区域分解算法,在空间自然边界归化的基础上,以三维Helmholtz方程外问题为例进行D-N交替算法,给出了该算法与Richardson迭代法的等价性,并分析了算法的离散化和收敛性,得到收敛速度与网格参数h无关。In this paper,we mainly study the domain decomposition algorithm of a long strip boundary surface in space.Based on the natural boundary space of domestication,taking the three-dimensional exterior Helmholtz problem as an example of the D-N alternating algorithm,we prove the equivalence of the algorithm to the Richardson iterative algorithm,and analyze the algorithm of discretization and convergence.The results show that convergence speed and the parameters in the grid are uncorrelated.

关 键 词：偏微分方程 长条型无界区域 区域分解算法 D-N交替算法 

分 类 号：O241.82[理学—计算数学]