Supercomputing challenges in electromagnetics
- Resource Type
- Conference
- Authors
- Taboada, J. M.; Landesa, L.; Obelleiro, F.; Rodriguez, J. L.; Araujo, M. G.; Bertolo, J. M.; Mourino, J. C.; Gomez, A.
- Source
- Proceedings of the Fourth European Conference on Antennas and Propagation Antennas and Propagation (EuCAP), 2010 Proceedings of the Fourth European Conference on. :1-4 Apr, 2010
- Subject
- Fields, Waves and Electromagnetics
Engineered Materials, Dielectrics and Plasmas
Components, Circuits, Devices and Systems
Computational complexity
Scalability
Iterative algorithms
Clustering algorithms
Partitioning algorithms
Parallel programming
Electromagnetics
Telecommunication computing
Seals
Fast Fourier transforms
- Language
- ISSN
- 2164-3342
The Fast Fourier Transform (FFT) extension of the conventional Fast Multipole Method (FMM) has demonstrated that it reduces the matrix vector product (MVP) complexity while preserving the propensity for parallel scaling of the single level FMM. An efficient hybrid MPI/OpenMP parallel implementation of the FMM-FFT and, subsequently, an improved nested scheme of the algorithm have been employed successfully for the solution of challenging problems with hundreds of millions of unknowns.