Abstract

In this paper, a new finite-difference time-domain (FDTD) algorithm is proposed in order to eliminate the Courant-Friedrich-Levy (CFL) condition restraint. The new algorithm is based on an alternating-direction implicit method. It is shown that the new algorithm is quite stable both analytically and numerically even when the CFL condition is not satisfied. Therefore, if the minimum cell size in the computational domain is required to be much smaller than the wavelength, this new algorithm is more efficient than conventional FDTD schemes in terms of computer resources such as central-processing-unit time. Numerical formulations are presented and simulation results are compared to those using the conventional FDTD method.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.