z-logo
open-access-imgOpen Access
Acceleration of FDTD mode solver by high-performance computing techniques
Author(s) -
Lin Han,
Yanping Xi,
WeiPing Huang
Publication year - 2010
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.18.013679
Subject(s) - finite difference time domain method , solver , computer science , computational science , cuda , parallel computing , graphics processing unit , mode (computer interface) , finite difference method , optics , algorithm , physics , mathematics , mathematical analysis , programming language , operating system
A two-dimensional (2D) compact finite-difference time-domain (FDTD) mode solver is developed based on wave equation formalism in combination with the matrix pencil method (MPM). The method is validated for calculation of both real guided and complex leaky modes of typical optical waveguides against the bench-mark finite-difference (FD) eigen mode solver. By taking advantage of the inherent parallel nature of the FDTD algorithm, the mode solver is implemented on graphics processing units (GPUs) using the compute unified device architecture (CUDA). It is demonstrated that the high-performance computing technique leads to significant acceleration of the FDTD mode solver with more than 30 times improvement in computational efficiency in comparison with the conventional FDTD mode solver running on CPU of a standard desktop computer. The computational efficiency of the accelerated FDTD method is in the same order of magnitude of the standard finite-difference eigen mode solver and yet require much less memory (e.g., less than 10%). Therefore, the new method may serve as an efficient, accurate and robust tool for mode calculation of optical waveguides even when the conventional eigen value mode solvers are no longer applicable due to memory limitation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here