An efficient parallel implementation of the multilevel fast multipole algorithm for rigorous solutions of large-scale scattering problems
Symposium Digest - 20th URSI International Symposium on Electromagnetic Theory, EMTS 2010
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28421
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. © 2010 IEEE.
- Conference Paper 
Showing items related by title, author, creator and subject.
Tse, S.S.H. (2008)We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing ...
Akçay H.G.; Aksoy, S. (2008)The object-based analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixel-based spectral information in classification. In this paper, we present novel methods ...
SarıyÃ¼ce A.E.; Gedik B.; Jacques-Silva G.; Wu K.-L.; Ã atalyÃ¼rek Ã .V. (Springer New York LLC, 2016)A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ...