求解具有长条型内边界的二维调和外问题的一种非重叠型区域分解算法  

An Non-overlapping Domain Decomposition Algorithm for Exterior Two-dimesional Harmonic Problems in Elongated Domains

作　　者：黄红英[1] 朱薇[1] 

机构地区：[1]南京师范大学数学与计算机科学学院,江苏南京210097

出　　处：《南京师大学报（自然科学版）》2004年第2期27-33,共7页Journal of Nanjing Normal University(Natural Science Edition)

摘　　要：以二维调和外问题为例 ,提出一种带椭圆型人工边界的非重叠型区域分解算法 .理论分析及数值实验表明 ,用该方法求解带长条型内边界的外问题是十分有效的 .A non-overlapping domain decomposition algorithm which is based on the elliptic artifial boundary for solving the two-dimensional harmonic problems over unbounded domain is offered and iterative convengence of its discreted form is discussed. Theoretical analysis as well as numerical results show that this method is very efficient for exterior two-dimentional harmonic problems in elongted domains.

关 键 词：长条型内边界 二维调和外问题 非重叠型区域分解算法 椭圆型人工边界 有限元 边值问题 

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