Alternating Asymmetric Iterative Algorithm Based on Domain Decomposition for 3D Poisson Problem
Alternating Asymmetric Iterative Algorithm Based on Domain Decomposition for 3D Poisson Problem
复制标题
DOI：
10.3390/math8020281
复制
发表时间：
2020-02
期刊：
影响因子：
2.4
通讯作者：
Qiuyan Xu;Zhiyong Liu
中科院分区：
文献类型：
--
作者：
Qiuyan Xu;Zhiyong Liu
Poisson equation is a widely used partial differential equation. It is very important to study its numerical solution. Based on the strategy of domain decomposition, the alternating asymmetric iterative algorithm for 3D Poisson equation is provided. The solution domain is divided into several sub-domains, and eight asymmetric iterative schemes with the relaxation factor for 3D Poisson equation are constructed. When the numbers of iteration are odd or even, the computational process of the presented iterative algorithm are proposed respectively. In the calculation of the inner interfaces, the group explicit method is used, which makes the algorithm to be performed fast and in parallel, and avoids the difficulty of solving large-scale linear equations. Furthermore, the convergence of the algorithm is analyzed theoretically. Finally, by comparing with the numerical experimental results of Jacobi and Gauss Seidel iterative algorithms, it is shown that the alternating asymmetric iterative algorithm based on domain decomposition has shorter computation time, fewer iteration numbers and good parallelism.
