Premium
A comparison of the performance of the finite difference time‐domain, finite element time‐domain, and planar generalized Yee algorithms of high‐performance parallel computers
Author(s) -
Gedney Stephen D.,
Navsariwala Umesh
Publication year - 1995
Publication title -
international journal of numerical modelling: electronic networks, devices and fields
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.249
H-Index - 30
eISSN - 1099-1204
pISSN - 0894-3370
DOI - 10.1002/jnm.1660080311
Subject(s) - finite difference time domain method , finite element method , parallel algorithm , maxwell's equations , algorithm , mathematics , planar , grid , scattering matrix method , domain (mathematical analysis) , finite difference method , computer science , mathematical analysis , geometry , physics , computer graphics (images) , thermodynamics , quantum mechanics
Parallel algorithms for the finite difference time‐domain (FDTD), the planar generalized Yee (PGY), and the finite element time‐domain (FETD) methods are presented. The FDTD and the PGY algorithms are both explicit time‐domain solutions of Maxwell's equations, while the PGY algorithm is based on an unstructured grid. The FETD algorithm is a semi‐implicit solution of Maxwell's equations using variational principles, and thus requires a matrix inversion for every time iteration. The three parallel algorithms are based on spatial decompositions of the discrete three‐dimensional problem spaces. A comparative analysis of the parallel algorithms is presented based on their memory and computational efficiency as well as their parallel efficiency.