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

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.

Authors

Institutions

Publication Details

Journal
IEEE Antennas and Wireless Propagation Letters
Published
2024-09-16
DOI
https://doi.org/10.1109/lawp.2024.3462446
Citations
3
Primary Topic
Brain Tumor Detection and Classification
Type
article
Field-Weighted Citation Impact
0.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Yu-Feng Zou, Shui‐Rong Chai, Pu-Kun Dai, Linghui Meng
3 citations
IEEE Antennas and Wireless Propagation Letters
Brain Tumor Detection and Classification
0.74
article

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

Yu-Feng Zou, Shui‐Rong Chai, Pu-Kun Dai, Linghui Meng
article en
3 citations

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 LettersVol. 23(12)
Xidian University (CN)
Openalex Percentile: Top 28%
Brain Tumor Detection and Classification
0.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.