{"title":"一种新的泊松方程并行连续超松弛迭代算法","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":"{\"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}","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}
A New Parallel Successive Overrelaxation Iterative Algorithm for Poisson Equation
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.