Efficient Algorithm for Scattering by a Large Cluster of Moving Objects

Abstract

A highly efficient algorithm for analysis of electromagnetic scattering by a large cluster of independently moving objects is proposed in this paper. A double octree structure is introduced, which consists of a main octree stationary to the cluster as a whole, and many sub-octrees moving with individual objects. Based on the new double octree structure, the computation of interactions between two elements is divided into four categories: the two elements are on the same object and are near; the two elements are on the same object but are far; the two elements are on different objects but the two objects are adjacent; the two elements are on different objects and the two objects are non-adjacent. For different interacting categories, different approaches are adopted to maximize the computing efficiency. The new algorithm enables possible fast simulations of scattering by hundreds of independently moving objects. Compared with the conventional Multilevel Fast Multipole Algorithm (MLFMA) and the recently developed Multi-Moving-Object (MMO)-MLFMA, the present scheme has substantial improvement in saving CPU time, providing a viable solution for engineering applications. Numerical validations for accuracy and efficiency are performed.

Keywords

• Cluster of moving objects
• fast algorithm
• scattering analysis