CG-FFT方法与递归聚合t矩阵算法(电磁波散射)的比较

Lin Jiun-Hwa, W. Chew
{"title":"CG-FFT方法与递归聚合t矩阵算法(电磁波散射)的比较","authors":"Lin Jiun-Hwa, W. Chew","doi":"10.1109/APS.1992.221732","DOIUrl":null,"url":null,"abstract":"A comparison of the computing performances of the conjugate-gradient fast Fourier transform (CG-FFT) method and the recursive aggregate T-matrix algorithm (RATMA) is presented. The advantages of each method are discussed. It is shown that, when the biconjugate CG-FET (BiCG-FFT) works, even for lossless cases, its CPU time performance is quite comparable with RATMA. Since the FFT is a highly vectorizable scheme, implementation of CG-FET or BiCG-FFT on a parallel processing machine will increase the efficiency and save much computing time. However, that this is only for a single incidence angle. If different incident fields are considered, one needs to go through the whole process again for CGM or BiCGM. However, RATMA is valid for any incident field from any angle.<<ETX>>","PeriodicalId":289865,"journal":{"name":"IEEE Antennas and Propagation Society International Symposium 1992 Digest","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A comparison of the CG-FFT method and the recursive aggregate T-matrix algorithm (EM wave scattering)\",\"authors\":\"Lin Jiun-Hwa, W. Chew\",\"doi\":\"10.1109/APS.1992.221732\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A comparison of the computing performances of the conjugate-gradient fast Fourier transform (CG-FFT) method and the recursive aggregate T-matrix algorithm (RATMA) is presented. The advantages of each method are discussed. It is shown that, when the biconjugate CG-FET (BiCG-FFT) works, even for lossless cases, its CPU time performance is quite comparable with RATMA. Since the FFT is a highly vectorizable scheme, implementation of CG-FET or BiCG-FFT on a parallel processing machine will increase the efficiency and save much computing time. However, that this is only for a single incidence angle. If different incident fields are considered, one needs to go through the whole process again for CGM or BiCGM. However, RATMA is valid for any incident field from any angle.<<ETX>>\",\"PeriodicalId\":289865,\"journal\":{\"name\":\"IEEE Antennas and Propagation Society International Symposium 1992 Digest\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Antennas and Propagation Society International Symposium 1992 Digest\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APS.1992.221732\",\"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 1992 Digest","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.1992.221732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

比较了共轭梯度快速傅里叶变换(CG-FFT)方法和递归聚合t矩阵算法(RATMA)的计算性能。讨论了每种方法的优点。结果表明,当双共轭CG-FET (BiCG-FFT)工作时,即使在无损情况下,其CPU时间性能也与RATMA相当。由于FFT是一种高度可向化的方案,在并行处理机上实现CG-FET或BiCG-FFT将提高效率并节省大量计算时间。但是,这只是针对单一入射角。如果考虑不同的入射场,则需要重新进行CGM或BiCGM的整个过程。然而,RATMA对于任何角度的入射场都是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A comparison of the CG-FFT method and the recursive aggregate T-matrix algorithm (EM wave scattering)
A comparison of the computing performances of the conjugate-gradient fast Fourier transform (CG-FFT) method and the recursive aggregate T-matrix algorithm (RATMA) is presented. The advantages of each method are discussed. It is shown that, when the biconjugate CG-FET (BiCG-FFT) works, even for lossless cases, its CPU time performance is quite comparable with RATMA. Since the FFT is a highly vectorizable scheme, implementation of CG-FET or BiCG-FFT on a parallel processing machine will increase the efficiency and save much computing time. However, that this is only for a single incidence angle. If different incident fields are considered, one needs to go through the whole process again for CGM or BiCGM. However, RATMA is valid for any incident field from any angle.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信