Abstract
MLFMA (multilevel fast multipole algorithm) has made a great achievement in solving electromagnetic scattering problems. In this paper we present our efforts to implement parallel MLFMA on a cluster of computers with distributed memory. In order to get a good load balancing a hybrid partition scheme for the distributed tree is used. We present a concept of virtual grids that can be used to easily determine the sender and receiver during interpolation and anterpolation for distributed levels and give some theorems governing the locations and relationships of real and virtual grids, and also give their proofs. Some test results demonstrate that our implementation has a high parallel efficiency for problems with a size of less than 2 million unknowns.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
