{"title":"Application of the multilevel field interpolation algorithm to large PEC structures in 2-D","authors":"H. Espinosa, A. Heldring, J. Rius","doi":"10.1109/APS.2007.4396819","DOIUrl":null,"url":null,"abstract":"The application of the Method of Moments to the analysis of large PEC structures is difficult due to the computational requirements when the structure is discretized in a high number of unknowns. To solve this problem we propose the Multilevel Field Interpolation Algorithm (MLFIA) based on a source domain decomposition that permits a fast matrix-vector multiplication within the iterative solution that reduces the computational complexity and the memory requirements to O(NlogN). The execution of the algorithm is composed of five steps that follow the computation of the field evaluated at a set of evaluation points within the observation domain, the extraction of the Green's function, the interpolation of the fields, the restoration of the Green's function and finally the aggregation of the fields. The algorithm is applied to the fast solution of 2D problems. The generalization to 3D problems is straightforward.","PeriodicalId":117975,"journal":{"name":"2007 IEEE Antennas and Propagation Society International Symposium","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Antennas and Propagation Society International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.2007.4396819","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The application of the Method of Moments to the analysis of large PEC structures is difficult due to the computational requirements when the structure is discretized in a high number of unknowns. To solve this problem we propose the Multilevel Field Interpolation Algorithm (MLFIA) based on a source domain decomposition that permits a fast matrix-vector multiplication within the iterative solution that reduces the computational complexity and the memory requirements to O(NlogN). The execution of the algorithm is composed of five steps that follow the computation of the field evaluated at a set of evaluation points within the observation domain, the extraction of the Green's function, the interpolation of the fields, the restoration of the Green's function and finally the aggregation of the fields. The algorithm is applied to the fast solution of 2D problems. The generalization to 3D problems is straightforward.