Abstract
In this work, we present a dispersive finite-difference time-domain (FDTD) algorithm using a four-pole complex rational function (CRF). For the sake of a better curve fitting of the four-pole CRF dispersion model, we use a particle swarm optimization technique. We also discuss an efficient memory storage strategy using a state-space approach. The numerical aspects of four-pole CRF-FDTD, the numerical accuracy and the numerical stability, are investigated in detail. Numerical examples are used to validate four-pole CRF-FDTD and numerical stability issues are discussed in detail. We also discuss the computational accuracy and the computational efficiency of an arbitrary $N$ -pole CRF-FDTD.
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 callDisclaimer: 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.
