An efficient AIM for the scattering computation of the finite sparse array

有限稀疏阵列散射计算的高效自适应积分算法

School of Electronic Information, Northwestern Polytechnical University, Xi’an 710072, China

Received: 2 April 2021

Abstract

Based on the traditional adaptive integral method(AIM), a fast method called array AIM is proposed to accelerate the scattering calculation of the finite periodic array and the sparse array. On one hand, this method could eliminate the idle grids through the utilization of 5-level block-Toeplitz matrix. Furthermore, the procedure of near correction is eliminated by applying the zeros shielding technique. On the other hand, the block Jacobi preconditioning technique is used to improve the iterative convergence, and the technique of wave path difference compensation is applied to accelerate the post-processing. The numerical results show that the proposed method not only possesses good accuracy, but also has much less cost both in time and memory, in comparison with the traditional AIM. Moreover, this method could be applied to solve the scattering problems for the finite periodic array, as well as the sparse array.

摘要

基于传统自适应积分法（AIM）提出了一种阵列自适应积分法，用于高效处理有限周期阵列和稀疏阵列的散射计算问题。该方法利用5层托普利兹（Toeplitz）矩阵技术解决了传统自适应积分法中冗余栅格点问题，并在此基础上利用零值屏蔽技术来消除远场对近场的干扰，省去近场矫正步骤。该方法还采用块状雅克比预处理来提升迭代求解效率，并使用波程差补偿技术加快远场后处理。仿真结果表明，该方法具有良好的计算精度，计算时间和内存消耗远小于传统AIM，并且不仅适用于有限周期阵列，也能仿真稀疏阵列的散射特性。