An efficient parallel implementation of the multilevel fast multipole algorithm for rigorous solutions of large-scale scattering problems

Download
2010-08-19
Ergül, Özgür Salih
Gürel, Levent
We present the solution of large-scale scattering problems discretized with hundreds of millions of unknowns. The multilevel fast multipole algorithm (MLFMA) is parallelized using the hierarchical partitioning strategy on distributed-memory architectures. Optimizations and load-balancing algorithms are extensively used to improve parallel MLFMA solutions. The resulting implementation is successfully employed on modest parallel computers to solve scattering problems involving metallic objects larger than 1000λ and discretized with more than 300 million unknowns.
Citation Formats
Ö. S. Ergül and L. Gürel, “An efficient parallel implementation of the multilevel fast multipole algorithm for rigorous solutions of large-scale scattering problems,” 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41777.