A New Parallel Successive Overrelaxation Iterative Algorithm for Poisson Equation

Qiuyan Xu
{"title":"A New Parallel Successive Overrelaxation Iterative Algorithm for Poisson Equation","authors":"Qiuyan Xu","doi":"10.1109/CyberC.2011.101","DOIUrl":null,"url":null,"abstract":"In this paper, a new parallel successive overrelaxation iterative algorithm (P-SOR) for solving 2D Poisson equation is presented based on domain decomposition strategy. The four Successive OverRelaxation (SOR) iterative schemes are used to implement the algorithm differently with the number of iterations of odd or even. Although the iterative schemes are semi-implicit, which can be computed explicitly and in parallel, in combining with the boundary conditions. Finally, several numerical experiments were performed to examine the efficiency and accuracy of the presented iterative algorithm.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2011.101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, a new parallel successive overrelaxation iterative algorithm (P-SOR) for solving 2D Poisson equation is presented based on domain decomposition strategy. The four Successive OverRelaxation (SOR) iterative schemes are used to implement the algorithm differently with the number of iterations of odd or even. Although the iterative schemes are semi-implicit, which can be computed explicitly and in parallel, in combining with the boundary conditions. Finally, several numerical experiments were performed to examine the efficiency and accuracy of the presented iterative algorithm.
一种新的泊松方程并行连续超松弛迭代算法
提出了一种基于区域分解策略求解二维泊松方程的并行连续超松弛迭代算法(P-SOR)。采用四种连续的过松弛(SOR)迭代方案,根据奇数或偶数的迭代次数不同来实现算法。虽然迭代格式是半隐式的,但结合边界条件可以显式并行计算。最后,通过数值实验验证了所提迭代算法的效率和精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信