Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Gedney et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: