In a previous paper, we proposed and tested a robust and efficient three-dimensional (3-D) subgridding algorithm for the FDTD solution method of the Maxwell's curl PDEs system. Its characteristic feature is the straight, non-recursive, embedding of Yee grids - refined by factors of 3, 5, 7 and even larger - within coarser ones. There, the algorithm's implementation was described with the traditional serial programming approach. In the present paper, we propose and test its parallel programming implementation. The goal is to make it suitable and efficient for large scale electromagnetic simulations.
Parallel implementation of a 3D subgridding FDTD algorithm for large simulations
Vaccari, Alessandro;Calà Lesina, Antonino;
2011-01-01
Abstract
In a previous paper, we proposed and tested a robust and efficient three-dimensional (3-D) subgridding algorithm for the FDTD solution method of the Maxwell's curl PDEs system. Its characteristic feature is the straight, non-recursive, embedding of Yee grids - refined by factors of 3, 5, 7 and even larger - within coarser ones. There, the algorithm's implementation was described with the traditional serial programming approach. In the present paper, we propose and test its parallel programming implementation. The goal is to make it suitable and efficient for large scale electromagnetic simulations.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
