Fast Computation of EM Scattering From Moving PEC Target Based on MT-ACA-MoM Algorithm

IF 4.8 2区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Antennas and Wireless Propagation Letters Pub Date : 2024-09-16 DOI:10.1109/LAWP.2024.3462446
Shui-Rong Chai;Ling-Hui Meng;Yu-Feng Zou;Pu-Kun Dai
{"title":"Fast Computation of EM Scattering From Moving PEC Target Based on MT-ACA-MoM Algorithm","authors":"Shui-Rong Chai;Ling-Hui Meng;Yu-Feng Zou;Pu-Kun Dai","doi":"10.1109/LAWP.2024.3462446","DOIUrl":null,"url":null,"abstract":"To solve the electromagnetic (EM) scattering problems involving a single, complexly moving perfectly electric conductor (PEC) with the traditional adaptive cross approximation-method of moment (ACA-MoM), the excitation vector and the impedance matrix need to be established repeatedly. Moreover, the matrix equation must be iteratively solved at each point in the movement trajectory. This leads to an increase in computational time, especially for targets exhibiting intricate movements. To address these challenges, a new algorithm named multiple time ACA-MoM (MT-ACA-MoM) is proposed and validated in this letter. This algorithm exploits the translation rotation invariance of Green's function. Consequently, regardless of the target's rotation and translation, the impedance matrix remains unchanged. Therefore, only one impedance matrix needs to be established and stored, which significantly reduces filling time. For the multiple-time problems, the excitation matrix exhibits high-rank deficiency. Therefore, in MT-ACA-MoM, ACA is utilized to compress both the impedance matrix and the excitation matrix. Numerical results demonstrate a reduction in the number of matrix equations from 2000 to approximately 100 to 200, leading to a further decrease in solving time of up to 94% and a total speedup of over 700 times.","PeriodicalId":51059,"journal":{"name":"IEEE Antennas and Wireless Propagation Letters","volume":"23 12","pages":"4628-4632"},"PeriodicalIF":4.8000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Antennas and Wireless Propagation Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10681267/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

To solve the electromagnetic (EM) scattering problems involving a single, complexly moving perfectly electric conductor (PEC) with the traditional adaptive cross approximation-method of moment (ACA-MoM), the excitation vector and the impedance matrix need to be established repeatedly. Moreover, the matrix equation must be iteratively solved at each point in the movement trajectory. This leads to an increase in computational time, especially for targets exhibiting intricate movements. To address these challenges, a new algorithm named multiple time ACA-MoM (MT-ACA-MoM) is proposed and validated in this letter. This algorithm exploits the translation rotation invariance of Green's function. Consequently, regardless of the target's rotation and translation, the impedance matrix remains unchanged. Therefore, only one impedance matrix needs to be established and stored, which significantly reduces filling time. For the multiple-time problems, the excitation matrix exhibits high-rank deficiency. Therefore, in MT-ACA-MoM, ACA is utilized to compress both the impedance matrix and the excitation matrix. Numerical results demonstrate a reduction in the number of matrix equations from 2000 to approximately 100 to 200, leading to a further decrease in solving time of up to 94% and a total speedup of over 700 times.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 MT-ACA-MoM 算法的移动 PEC 目标电磁散射快速计算
传统的自适应交叉逼近矩量法(ACA-MoM)在求解单个复杂运动完美电导体(PEC)的电磁散射问题时,需要反复建立激励矢量和阻抗矩阵。此外,矩阵方程必须在运动轨迹的每个点上迭代求解。这导致计算时间的增加,特别是对于表现出复杂运动的目标。为了解决这些挑战,本文提出了一种名为多次ACA-MoM (MT-ACA-MoM)的新算法,并在本文中进行了验证。该算法利用格林函数的平移旋转不变性。因此,无论目标的旋转和平移,阻抗矩阵都保持不变。因此,只需要建立和存储一个阻抗矩阵,这大大减少了填充时间。对于多时间问题,激励矩阵表现出高秩缺陷。因此,在MT-ACA-MoM中,ACA被用来压缩阻抗矩阵和激励矩阵。数值结果表明,矩阵方程的数量从2000个减少到大约100到200个,导致求解时间进一步减少高达94%,总速度提高超过700倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
8.00
自引率
9.50%
发文量
529
审稿时长
1.0 months
期刊介绍: IEEE Antennas and Wireless Propagation Letters (AWP Letters) is devoted to the rapid electronic publication of short manuscripts in the technical areas of Antennas and Wireless Propagation. These are areas of competence for the IEEE Antennas and Propagation Society (AP-S). AWPL aims to be one of the "fastest" journals among IEEE publications. This means that for papers that are eventually accepted, it is intended that an author may expect his or her paper to appear in IEEE Xplore, on average, around two months after submission.
期刊最新文献
Frequency-Reconfigurable Antenna Element for X-/Ku-Band Satellite User Terminals List of Reviewers 2025 An Efficient Optimization Method for E-Band Dielectric Lens Antenna With High Antenna Efficiency A Planar Sheet-Type Composite Electric and Magnetic Near-Field Probe Design of Angle-Selective Surface With Narrow Angular Domain and Ultra-Narrow Angular Transition Range
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1