Discusses a parallel algorithm for the finite‐difference time domain method. In particular, investigates electromagnetic field propagation in two and three dimensions. The computational intensity of such problems necessitates the use of multiple processors to realise solutions to interesting problems in a reasonable time. Presents the parallel algorithm with examples, and uses aspects of graph theory to examine the communication overhead of the algorithm in practice. This is achieved by observing the dynamically changing adjacency matrix of the communications graph.
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering – Emerald Publishing
Published: Sep 1, 2004
Keywords: Modelling; Finite difference time‐domain analysis; Magnetic fields; Graph theory