Title :
Supercomputing challenges in electromagnetics
Author :
J. M. Taboada;L. Landesa;F. Obelleiro;J. L. Rodríguez;M. G. Araújo;J. M. Bértolo;J. C. Mouriño;A. Gómez
Author_Institution :
Dept. Tecnologas de los Computadores y de las Comunicaciones, Escuela Polité
Abstract :
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.
Keywords :
"Computational complexity","Scalability","Iterative algorithms","Clustering algorithms","Partitioning algorithms","Parallel programming","Electromagnetics","Telecommunication computing","Seals","Fast Fourier transforms"
Conference_Titel :
Antennas and Propagation (EuCAP), 2010 Proceedings of the Fourth European Conference on
Print_ISBN :
978-1-4244-6431-9
