{"title":"用Clifford代数和多维柯西积分并行计算电磁场迭代解","authors":"A. Chantaveerod, T. Limpiti, A. Seagar","doi":"10.1109/TENCON.2014.7022336","DOIUrl":null,"url":null,"abstract":"Design of a parallel computation of iterative solution for electromagnetic fields formulation obtained from the multidimensional Cauchy integral equations based on Clifford algebra on a multi-computer system is presented. The presented parallel algorithm enhances the Cauchy integral equations whose kernel of integration is simple and contains weakly singular integral by saving time consuming and increasing the memory capacity in the calculation. To implement and demonstrate the computation, the domain decomposition techniques and the Message Passing Interface (MPI) programming are respectively exploited. The performance of the presented algorithm is investigated in two aspects: the speed and the efficiency of calculation. The speed linearly increases as a number of processors are added while the efficiency is always near 1.0.","PeriodicalId":292057,"journal":{"name":"TENCON 2014 - 2014 IEEE Region 10 Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel computation of iterative solution for electromagnetic fields using Clifford algebra and the multidimensional Cauchy integral\",\"authors\":\"A. Chantaveerod, T. Limpiti, A. Seagar\",\"doi\":\"10.1109/TENCON.2014.7022336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Design of a parallel computation of iterative solution for electromagnetic fields formulation obtained from the multidimensional Cauchy integral equations based on Clifford algebra on a multi-computer system is presented. The presented parallel algorithm enhances the Cauchy integral equations whose kernel of integration is simple and contains weakly singular integral by saving time consuming and increasing the memory capacity in the calculation. To implement and demonstrate the computation, the domain decomposition techniques and the Message Passing Interface (MPI) programming are respectively exploited. The performance of the presented algorithm is investigated in two aspects: the speed and the efficiency of calculation. The speed linearly increases as a number of processors are added while the efficiency is always near 1.0.\",\"PeriodicalId\":292057,\"journal\":{\"name\":\"TENCON 2014 - 2014 IEEE Region 10 Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TENCON 2014 - 2014 IEEE Region 10 Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.2014.7022336\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TENCON 2014 - 2014 IEEE Region 10 Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2014.7022336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel computation of iterative solution for electromagnetic fields using Clifford algebra and the multidimensional Cauchy integral
Design of a parallel computation of iterative solution for electromagnetic fields formulation obtained from the multidimensional Cauchy integral equations based on Clifford algebra on a multi-computer system is presented. The presented parallel algorithm enhances the Cauchy integral equations whose kernel of integration is simple and contains weakly singular integral by saving time consuming and increasing the memory capacity in the calculation. To implement and demonstrate the computation, the domain decomposition techniques and the Message Passing Interface (MPI) programming are respectively exploited. The performance of the presented algorithm is investigated in two aspects: the speed and the efficiency of calculation. The speed linearly increases as a number of processors are added while the efficiency is always near 1.0.