含复杂细节结构的金属目标电磁散射ACE-MLFMA 分析

多层快速多极子算法(MLFMA)在计算含复杂细节结构目标的散射问题时,求解效率会迅速下降。本文介绍了快 速笛卡尔展开(ACE)算法及其与MLFMA 的结合,使得原先MLFMA 的最细层能够再局部细分,加速了阻抗矩阵的填充 和迭代求解。本文将该混合算法应用于求解含复杂细节结构目标的电磁散射问题,包括具有尖端的杏仁核和由复杂带线 结构构成的频率选择表面,计算实例验证了该方法求解效率的提高和内存开销的减少,以及算法的可靠性和高效性。     

An IE-ODDM-MLFMA Scheme With DILU Preconditioner for Analysis of Electromagnetic Scattering From Large Complex Objects

For electrically large complex electromagnetic (EM) scattering problems, huge memory is often required for most EM solvers, which is too difficult to be handled by a personal computer (PC) even a workstation. Although the multilevel fast multipole algorithm (MLFMA) effectively deals with electrically large problems to some extent, it is still time and memory consuming for very large objects. In order to further reduce the CPU time and the memory requirement, a hybrid algorithm, based on the overlapped domain decomposition method for integral equations (IE-ODDM), MLFMA and block-diagonal, incomplete lower and upper triangular matrices (DILU) preconditioner, is proposed for the analysis of electrically large problems. The dominant memory requirement for plane wave expansions in the three processes of aggregation, translation and disaggregation in the MLFMA is drastically reduced by the first two techniques. The iterative procedure for each overlapped subdomain solved by the MLFMA is effectively sped up by the DILU preconditioner. After integrating these techniques, the proposed hybrid algorithm is more efficient in computing time and memory requirement compared to the conventional MLFMA and is more suitable for analyzing very large EM scattering problems. Enough accurate solution can be obtained within quite a few outer iterations, where an outer iteration means a complete sweep for all the subdomains. Some numerical examples are presented to demonstrate its validity and efficiency.     

Monte Carlo simulation of electromagnetic scattering fromtwo-dimensional random rough surfaces

The fast multipole method fast Fourier transform (FMM-FFT) method is developed to compute the scattering of an electromagnetic wave from a two-dimensional (2-D) rough surface. The resulting algorithm computes a matrix-vector multiply in O(N log N) operations. This algorithm is shown to be more efficient than another O(N log N) algorithm, the multilevel fast multipole algorithm (MLFMA), for surfaces of small height. For surfaces with larger roughness, the MLFMA is found to be more efficient. Using the MLFMA, Monte Carlo simulations are carried out to compute the statistical properties of the electromagnetic scattering from 2-D random rough surfaces using a workstation. For the rougher surface, backscattering enhancement is clearly observable as a pronounced peak in the backscattering direction of the computed bistatic scattering coefficient. For the smoother surface, the Monte Carlo results compare well with the results of the approximate Kirchhoff theory     

用于复杂目标三维矢量散射分析的快速多极子方法

本文着重介绍了一种用于复杂目标三维电磁散射精确建模和数值分析的高型高效数值方法,即快速多极子方法和多层快速多极子方法。     

Efficient MLFMA, RPFMA, and FAFFA algorithms for EM scattering by very large structures

Based on the addition theorem, the principle of a multilevel ray-propagation fast multipole algorithm (RPFMA) and fast far-field approximation (FAFFA) has been demonstrated for three-dimensional (3-D) electromagnetic scattering problems. From a rigorous mathematical derivation, the relation among RPFMA, FAFFA, and a conventional multilevel fast multipole algorithm (MLFMA) has been clearly stated. For very large-scale problems, the translation between groups in the conventional MLFMA is expensive because the translator is defined on an Ewald sphere with many sampling k/spl circ/ directions. When two groups are well separated, the translation can be simplified using RPFMA, where only a few sampling k/spl circ/ directions are required within a cone zone on the Ewald sphere. When two groups are in the far-field region, the translation can be further simplified by using FAFFA where only a single k/spl circ/ is involved in the translator along the ray-propagation direction. Combining RPFMA and FAFFA with MLFMA, three algorithms RPFMA-MLFMA, FAFFA-MLFMA, and RPFMA-FAFFA-MLFMA have been developed, which are more efficient than the conventional MLFMA in 3-D electromagnetic scattering and radiation for very large structures. Numerical results are given to verify the efficiency of the algorithms.     

并行处理技术在电大尺寸复杂目标电磁散射中的应用

虽然快速多极子算法FMM(Fast Multipole Method)和多层快速多极子算法MLFMA(Multi-Level Fast Multipole Algorithm)是解决复杂目标电磁散射问题比较有效的方法,但是当问题的规模较大时,传统的串行FMM 和MLFMA难以胜任.本文在工作站网络系统NOW(Network Of Workstation)上采用并行处理技术来解决电大尺寸复杂目标电磁散射问题.结果表明:本文提出的并行解决方案与国内外相关成果相比不仅更具实用性,并行效率达到54%以上,且解决了串行方法难以解决的电磁散射问题,本文在四台DEC工作站构成的NOW系统上用32小时完成了未知量为160,000的雷达散射截面的计算.     

合元极技术再认识--一种电大复杂目标散射混合计算技术的考察

合元极技术,即混合有限元、边界元、快速多极子技术,是计算电磁学中近年来日益受到关注的一种精确、高效、通用的技术.本文首先将此技术推广应用于既带涂层又带腔的复杂电大目标电磁散射的计算;接着对合元极技术各种算法的计算精度、迭代收敛速度进行了理论和数值实验的分析研究;然后,从通用性和高效性的角度,对作者采用的不对称合元极技术和近来来其他作者提出的对称合元极技术做了分析比较.最后,本文计算了几种复杂目标的散射截面以证实此项技术的高效、通用.     

三维导电目标电磁散射的高阶多层快速多极子方法

为进一步提高电大尺寸目标散射求解能力,采用了基于多层快速多极子方法的高阶方法.与低阶相比,该方法所需未知量数目大大减少,而计算精度不变,因而具有比传统多层快速多极子方法更高的计算效率.给出的典型计算结果充分说明了高阶多层快速多极子方法的高效性.     

Comparison of Integral-Equation Formulations for the Fast and Accurate Solution of Scattering Problems Involving Dielectric Objects with the Multilevel Fast Multipole Algorithm

We consider fast and accurate solutions of scattering problems involving increasingly large dielectric objects formulated by surface integral equations. We compare various formulations when the objects are discretized with Rao-Wilton-Glisson functions, and the resulting matrix equations are solved iteratively by employing the multilevel fast multipole algorithm (MLFMA). For large problems, we show that a combined-field formulation, namely, the electric and magnetic current combined-field integral equation (JMCFIE), requires fewer iterations than other formulations within the context of MLFMA. In addition to its efficiency, JMCFIE is also more accurate than the normal formulations and becomes preferable, especially when the problems cannot be solved easily with the tangential formulations.      

Solution of combined-field integral equation using multilevel fastmultipole algorithm for scattering by homogeneous bodies

We present an accurate method of moments (MoM) solution of the combined field integral equation (CFIE) using the multilevel fast multipole algorithm (MLFMA) for scattering by large, three-dimensional (3-D), arbitrarily shaped, homogeneous objects. We first investigate several different MoM formulations of the CFIE and propose a new formulation, which is both accurate and free of interior resonances. We then employ the MLFMA to significantly reduce the memory requirement and computational complexity of the MoM solution. Numerical results are presented to demonstrate the accuracy and capability of the proposed method. The method can be extended in a straightforward manner to scatterers composed of different homogeneous dielectric and conducting objects     

用于分析电磁散射问题的快速多极算法

介绍了用于分析电磁散射问题的快速多极算法(FMA)和多层快速多极算法(MLFMA)的基本思想与基本步骤。通过计算实例表明,快速多极算法在计算速度和存贮要求方面比矩量法有明显优势,适合于在现有计算机条件下求解电大尺寸目标的散射问题。     

电大均匀介质目标三维散射的并行多层快速多极子计算

实现了计算电大均匀介质体散射问题的高效混合并行混合场积分方程(Electric and Magnetic Current Combined-Field Integral Equation, JMCFIE)求解, 在单纯消息传递接口(Message Passing Interface, MPI)并行基础上采用共享存储并行编程(Open Multi-Processing, OpenMP)进一步提升性能.该混合MPI与OpenMP的并行多层快速多极子技术通过灵活的进程和线程策略, 提升了负载平衡和可扩展性.数值实验展示了此混合MPI与OpenMP的并行多层快速多极子技术的计算能力, 计算了不同尺寸的电大目标体(包含一个半径120 m、1.1亿未知数目的介质球).     

并行多层快速多极子的高效预条件技术

多层快速多极子法是基于矩量法的快速算法,具有较低的计算复杂度和存储复杂度,被广泛应用于目标电磁散射特性分析。对于复杂结构电磁目标,由于矩阵条件数较差,往往存在迭代收敛慢甚至不收敛的问题。针对这一情况,文中利用快速多极子的近区矩阵,结合稀疏矩阵方程求解构造了一种高效预条件。数值实例表明该方法相比于块对角预条件效果更好,能有效加速多层快速多极子迭代过程。     

混合ACA和MLFMA方法计算复合目标电磁散射

采用矩量法(MoM)计算电大尺寸的复合目标的电磁散射。为了能够高效快速地计算电大尺寸三维复合目标的电磁散射,提出一种新的混合方法,将自适应交叉近似(ACA)算法和多层快速多级子(MLFMA)算法相结合,共同加速矩量法的计算。其中,MLFMA用于加速目标与自身的作用,ACA用于加速目标与其他目标的相互作用。提出的混合算法在计算复合目标电磁散射时,可降低运算存储,缩短阻抗矩阵填充时间,并且能够加快矩阵矢量乘,且不影响计算精确度。数值算例表明,所提快速算法能够在保证电磁散射计算精确度前提下,比传统方法更高效。     

A FAFFA-MLFMA algorithm for electromagnetic scattering

Based on the multilevel fast multipole algorithm (MLFMA), an efficient method is proposed to accelerate the solution of the combined field integral equation in electromagnetic scattering and radiation, where the fast far-field approximation (FAFFA) is combined with MLFMA. The translation between groups in MLFMA is expensive because spherical Hankel functions and Legendre polynomials are involved and the translator is defined on an Eward sphere with many k/spl circ/ directions. When two groups are in the far-field region, however, the translation can be greatly simplified by FAFFA where only a single k/spl circ/ direction is involved in the translator. The condition for using FAFFA and the way to efficiently incorporate FAFFA with MLFMA are discussed. Complexity analysis illustrates that the computational cost in FAFFA-MLFMA can be asymptotically cut by half compared to the conventional MLFMA. Numerical results are given to verify the efficiency of the algorithm.     

A higher order parallelized multilevel fast multipole algorithm for3-D scattering

A higher order multilevel fast multipole algorithm (MLFMA) is presented for solving integral equations of electromagnetic wave scattering by three-dimensional (3-D) conducting objects. This method employs higher order parametric elements to provide accurate modeling of the scatterer's geometry and higher order interpolatory vector basis functions for an accurate representation of the electric current density on the scatterer's surface. This higher order scheme leads to a significant reduction in the mesh density, thus the number of unknowns, without compromising the accuracy of geometry modeling. It is applied to the electric field integral equation (EFIE), the magnetic field integral equation (MFIE), and the combined field integral equation (CFIE), using Galerkin's testing approach. The resultant numerical system of equations is then solved using the MLFMA. Appropriate preconditioning techniques are employed to speedup the MLFMA solution. The proposed method is further implemented on distributed-memory parallel computers to harness the maximum power from presently available machines. Numerical examples are given to demonstrate the accuracy and efficiency of the method as well as the convergence of the higher order scheme     

A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm

We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributed-memory architectures to solve large-scale problems in electromagnetics. Unlike previous parallelization techniques, the tree structure of MLFMA is distributed among processors by partitioning both clusters and samples of fields at each level. Due to the improved load-balancing, the hierarchical strategy offers a higher parallelization efficiency than previous approaches, especially when the number of processors is large. We demonstrate the improved efficiency on scattering problems discretized with millions of unknowns. In addition, we present the effectiveness of our algorithm by solving very large scattering problems involving a conducting sphere of radius 210 wavelengths and a complicated real-life target with a maximum dimension of 880 wavelengths. Both of the objects are discretized with more than 200 million unknowns.      

Broadband Müller-MLFMA for Electromagnetic Scattering by Dielectric Objects

The multilevel fast multipole algorithm (MLFMA) is very efficient for solving large-scale electromagnetic scattering problems. However, at low frequencies, or when the discretization is small compared with the wavelength, both the MLFMA and the underlying integral equation formulation typically suffer from a subwavelength breakdown. For the electromagnetic scattering from a homogeneous dielectric object, we obtain a stable and well-conditioned surface integral formulation using a variant of the classical Muumlller formulation and linear basis functions. To overcome the subwavelength breakdown of the MLFMA, we use both propagating and evanescent plane waves to represent the fields. The implementation is based on a combination of the spectral representation of the Green's function and Rokhlin's translation formula. We also present a new interpolation scheme for the evanescent part, which significantly improves the error-controllability of the MLFMA-implementation. Several numerical results verify both the error-controllability and scalability of the proposed algorithm     

混合场积分方程结合MLFMA分析导体介质复合目标电磁散射问题

针对组合目标电磁散射问题,采用一类新的混合场积分方程进行分析.通过合理选择比例系数组合表面电场和磁场积分方程,构造出具有良好收敛性的阻抗矩阵.MLFMA的迭代求解采用广义最小残差方法(GMRES),结合预条件技术进一步减少迭代次数,加速计算并提高处理电大尺寸导体介质复合目标的能力.研究了几类典型目标电磁散射特性并比较了计算效率,数值算例验证了该方法的准确性和高效性.     

Multilevel fast multipole algorithm for general targets on a half-space interface

The multilevel fast multipole algorithm (MLFMA) is considered for scattering from an electrically large conducting or dielectric target resting on the interface of a dielectric half-space. We focus on analysis of the half-space Green's function such that it is computed efficiently and accurately, while retaining a form that is applicable to an MLFMA analysis. Attention is also directed toward development of a simple preconditioner to accelerate convergence of the conjugate-gradient solver. The utility of the model is examined for several applications, including scattering from an electrically large vehicle, trees, and rough dielectric interfaces in the presence of a dielectric half-space background.