Towards an asynchronous, scalable MLFMA for three-dimensional electromagnetic problems

This paper presents the progress in the development of a scalable parallel MultiLevel Fast Multipole Algorithm (MLFMA) for three-dimensional (3D) electromagnetic problems. Scalability stands for the ability to handle a larger problem on a proportionally larger parallel computer architecture. As a partitioning scheme, hierarchical partitioning (HP) is used, which divides the work load in a very balanced way. This prevents the time, memory and communication complexity per cpu-core from increasing rapidly as a function of the number of cpu-cores and unknowns.