{"title":"Combined multilevel FMM-QR algorithm for broadband applications","authors":"I. Chowdhury, S. Chakraborty, V. Jandhyala","doi":"10.1109/APS.2006.1710939","DOIUrl":null,"url":null,"abstract":"This paper presents a combined multilevel FMM-QR approach applicable to three-dimensional scattering problems of widely varying electrical sizes. The classic MLFMA suffers breakdown at low frequencies (I. Bogaert et al., 2005), while QR based methods become inefficient at high frequencies (D. Gope and V. Jandhyala, 2005). The presented algorithm combines these two methods to achieve stability at all frequencies, and at the same time preserves the O(NlogN) complexity of setup, memory and matrix-vector products. Examples demonstrating time and memory requirements are presented, and the efficient nature of the overall method at all frequencies is also demonstrated","PeriodicalId":6423,"journal":{"name":"2006 IEEE Antennas and Propagation Society International Symposium","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Antennas and Propagation Society International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.2006.1710939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper presents a combined multilevel FMM-QR approach applicable to three-dimensional scattering problems of widely varying electrical sizes. The classic MLFMA suffers breakdown at low frequencies (I. Bogaert et al., 2005), while QR based methods become inefficient at high frequencies (D. Gope and V. Jandhyala, 2005). The presented algorithm combines these two methods to achieve stability at all frequencies, and at the same time preserves the O(NlogN) complexity of setup, memory and matrix-vector products. Examples demonstrating time and memory requirements are presented, and the efficient nature of the overall method at all frequencies is also demonstrated
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
