Parallel iterative finite element algorithms based on full domain partition for the stationary Navier--Stokes equations
Parallel iterative finite element algorithms based on full domain partition for the stationary Navier--Stokes equations
复制标题
DOI：
10.1016/j.apnum.2010.03.013
复制
发表时间：
2010-07
影响因子：
2.8
通讯作者：
Yueqiang Shang;Yinnian He
中科院分区：
文献类型：
--
作者：
Yueqiang Shang;Yinnian He
基于全区域剖分，提出了求解定常Navier-Stokes方程的三种并行迭代有限元算法，并对算法进行了分析。在这些算法中，每个子问题被定义在整个域中，其中绝大多数自由度与它负责的特定子域相关联，因此可以使用现有的顺序求解器与其他子问题并行求解，而无需大量重新编码。所有的子问题都是非线性的，分别用三种迭代方法求解。在一定的（强）唯一性条件下，给出了并行迭代有限元解的误差估计。最后给出了一些数值结果，证明了并行迭代算法的有效性。
Based on full domain partition, three parallel iterative finite element algorithms for the stationary Navier–Stokes equations are proposed and analyzed. In these algorithms, each subproblem is defined in the entire domain with the vast majority of the degrees of freedom associated with the particular subdomain that it is responsible for and hence can be solved in parallel with other subproblems using an existing sequential solver without extensive recoding. All of the subproblems are nonlinear and are independently solved by three kinds of iterative methods. Under some (strong) uniqueness conditions, errors of the parallel iterative finite element solutions are estimated. Some numerical results are also given which demonstrate the efficiency of the parallel iterative algorithms.