{"title":"Power decomposition method for compression of the electric-field integral equation","authors":"L. Landesa, G. Gajardo-Silva, J. M. Taboada","doi":"10.1109/CEM.2009.5228102","DOIUrl":null,"url":null,"abstract":"We focus on the problem of compression of farfield interactions in the matrices of the method of moments. We present a new point of view with respect to other alternatives: instead of compressing each block of the impedance matrix (corresponding to the mutual coupling between a pair of geometry groups), our hypothesis here is that this compression can be separately obtained inside of each group. In this manner each group is compressed only once, which allows us to obtain larger compression rates than the usual mutual-coupling based schemes. With this idea, we propose a recursive mechanism similar to that used in the multilevel fast multipole method, leading to a hi erarchical multilevel building of macro basis functions that finally provides a O(N logN) algorithm for computational electromagnetics. Moreover, the proposed calculation of compressed basis functions is completely independent on the excitation.","PeriodicalId":416029,"journal":{"name":"2009 Computational Electromagnetics International Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Computational Electromagnetics International Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEM.2009.5228102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We focus on the problem of compression of farfield interactions in the matrices of the method of moments. We present a new point of view with respect to other alternatives: instead of compressing each block of the impedance matrix (corresponding to the mutual coupling between a pair of geometry groups), our hypothesis here is that this compression can be separately obtained inside of each group. In this manner each group is compressed only once, which allows us to obtain larger compression rates than the usual mutual-coupling based schemes. With this idea, we propose a recursive mechanism similar to that used in the multilevel fast multipole method, leading to a hi erarchical multilevel building of macro basis functions that finally provides a O(N logN) algorithm for computational electromagnetics. Moreover, the proposed calculation of compressed basis functions is completely independent on the excitation.