检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《佳木斯大学学报(自然科学版)》2011年第3期444-446,共3页Journal of Jiamusi University:Natural Science Edition
摘 要:以二维双调和外问题为例,提出一种带圆型人工边界的非重叠区域分解算法.构造其算法并讨论相应的离散化问题的收敛性,证明算法收敛速度与有限元网格参数无关,适当选取松弛因子,算法是几何收敛的.理论分析表明,用该方法求解无界区域问题是十分有效的.In this paper,a non-overlapping domain decomposition algorithm based on the circular artificial boundary for solving the two-dimensional exterior bi-harmonic problems was offered.The algorithm was constructed and the convergence of its discrete problems was discussed.It is proved that the convergence rate of the algorithm is independent on the finite element mesh size.With proper selection of the relaxation factor,it is proved that the convergence rate of the algorithm is geometrical.Theoretical analysis shows that this method is very efficient for solving the unbounded domain problems.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.132.48