{"title":"矢量格林函数多极展开截断的误差分析","authors":"Jiming Song, W. C. Chew","doi":"10.1109/7260.933781","DOIUrl":null,"url":null,"abstract":"The advent of fast algorithms in computational electromagnetics has permitted the solution of integral equations with an unprecedented number of unknowns. This is the consequence of the development of the fast multipole algorithms (FMA) and the multilevel fast multipole algorithms (MLFMA). Such algorithms allow a matrix-vector multiplication to be performed in O(NlogN) operations or less for many scattering problems. Moreover, the memory requirements of these methods are O(NlogN), or almost matrix free. Using the fast matrix-vector multiplications in an iterative solver, problems for integral equations involving millions of unknowns have been solved previously. One of the most important mathematical formulas in FMA is the addition theorem. In the numerical implementation of the addition theorem, the infinite series should be truncated. The error analysis for the truncation error in the scalar Green's functions has been done by many researchers. In this paper, the error analysis for the truncation error in the multipole expansion of vector Green's functions is given.","PeriodicalId":391546,"journal":{"name":"IEEE Antennas and Propagation Society International Symposium. 1999 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.99CH37010)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"81","resultStr":"{\"title\":\"Error analysis for the truncation of multipole expansion of vector Green's functions\",\"authors\":\"Jiming Song, W. C. Chew\",\"doi\":\"10.1109/7260.933781\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The advent of fast algorithms in computational electromagnetics has permitted the solution of integral equations with an unprecedented number of unknowns. This is the consequence of the development of the fast multipole algorithms (FMA) and the multilevel fast multipole algorithms (MLFMA). Such algorithms allow a matrix-vector multiplication to be performed in O(NlogN) operations or less for many scattering problems. Moreover, the memory requirements of these methods are O(NlogN), or almost matrix free. Using the fast matrix-vector multiplications in an iterative solver, problems for integral equations involving millions of unknowns have been solved previously. One of the most important mathematical formulas in FMA is the addition theorem. In the numerical implementation of the addition theorem, the infinite series should be truncated. The error analysis for the truncation error in the scalar Green's functions has been done by many researchers. In this paper, the error analysis for the truncation error in the multipole expansion of vector Green's functions is given.\",\"PeriodicalId\":391546,\"journal\":{\"name\":\"IEEE Antennas and Propagation Society International Symposium. 1999 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.99CH37010)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"81\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Antennas and Propagation Society International Symposium. 1999 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.99CH37010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/7260.933781\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Antennas and Propagation Society International Symposium. 1999 Digest. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.99CH37010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/7260.933781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Error analysis for the truncation of multipole expansion of vector Green's functions
The advent of fast algorithms in computational electromagnetics has permitted the solution of integral equations with an unprecedented number of unknowns. This is the consequence of the development of the fast multipole algorithms (FMA) and the multilevel fast multipole algorithms (MLFMA). Such algorithms allow a matrix-vector multiplication to be performed in O(NlogN) operations or less for many scattering problems. Moreover, the memory requirements of these methods are O(NlogN), or almost matrix free. Using the fast matrix-vector multiplications in an iterative solver, problems for integral equations involving millions of unknowns have been solved previously. One of the most important mathematical formulas in FMA is the addition theorem. In the numerical implementation of the addition theorem, the infinite series should be truncated. The error analysis for the truncation error in the scalar Green's functions has been done by many researchers. In this paper, the error analysis for the truncation error in the multipole expansion of vector Green's functions is given.