Performing large full-wave simulations by means of a parallel MLFMA implementation

In this paper large full-wave simulations are performed using a parallel Multilevel Fast Multipole Algorithm (MLFMA) implementation. The data structures of the MLFMA-tree are partitioned according to the so-called hierarchical partitioning scheme, while the radiation patterns are partitioned in a blockwise way. To test the implementation of the algorithm, a full-wave simulation of a canonical example with more than 50 millions of unknowns has been performed.

[1]  Jan Fostier,et al.  Provably scalable parallel multilevel fast multipole algorithm , 2008 .

[2]  D. De Zutter,et al.  Towards an asynchronous, scalable MLFMA for three-dimensional electromagnetic problems , 2011, 2011 International Conference on Electromagnetics in Advanced Applications.

[3]  L. Gurel,et al.  Rigorous Solutions of Electromagnetic Problems Involving Hundreds of Millions of Unknowns , 2011, IEEE Antennas and Propagation Magazine.