Ergül O.Gürel, Levent2016-02-082016-02-082010http://hdl.handle.net/11693/28421Date of Conference: 16-19 Aug. 2010We 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.EnglishDistributed memoryHierarchical partitioningLarge-scale scatteringLoad-balancing algorithmMetallic objectsMulti-level fast multi-pole algorithmMultilevel fast multipole algorithmsParallel computerParallel implementationsRigorous solutionScattering problemsAlgorithmsElectric fieldsElectromagnetismScatteringProblem solvingConference Paper10.1109/URSI-EMTS.2010.5637203