Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-27T21:56:43.498Z Has data issue: false hasContentIssue false

Numerical simulation of an electromagnetic field by parallelized 3D AIBO-FDTD

Published online by Cambridge University Press:  20 December 2006

TOSHIHIRO HANAWA
Affiliation:
School of Computer Science, Tokyo University of Technology, 1404-1 Katakura-cho, Hachioji, Tokyo, 192-0982, Japan
SOICHIRO IKUNO
Affiliation:
School of Computer Science, Tokyo University of Technology, 1404-1 Katakura-cho, Hachioji, Tokyo, 192-0982, Japan

Abstract

The finite-difference time-domain (FDTD) method is useful in solving three-dimensional (3D) electromagnetic problems. However, it contains a numerical instability because it is a complete explicit method, and huge amounts of memory are required in the case of 3D analysis. The implicit FDTD method called the Alternating Implicit Block Overlapped (AIBO)-FDTD method was proposed for two-dimensional (2D) electromagnetic analysis. In our study, the 3D AIBO-FDTD method is developed by the modification of the 2D method. This method is suitable for parallel processing since the computational domain can be effectively partitioned. This property is especially compatible with implementations using distributed-memory multiprocessor systems such as PC clusters, which provide a huge memory space that accommodates a large problem. Although this method seems numerically stable since the implicit scheme is included, our result shows that the numerical instability occurs when the time step exceeds Courant's stability condition. This condition is still more relaxed than the conventional FDTD method. Furthermore, we demonstrated that parallel processing is an effective technique for improving the performance of the 3D AIBO-FDTD method, while this method is slower than FDTD when it is run on one processor.

Type
Papers
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)