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.
期刊介绍:
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.