z-logo
open-access-imgOpen Access
Explicit FDTD method based on iterated Crank–Nicolson scheme
Author(s) -
Shibayama Jun,
Nishio Tomomasa,
Yamauchi Junji,
Nakano Hisamatsu
Publication year - 2022
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/ell2.12335
Subject(s) - crank–nicolson method , iterated function , mathematics , finite difference time domain method , finite difference method , stability (learning theory) , finite difference , domain (mathematical analysis) , mathematical analysis , computer science , physics , quantum mechanics , machine learning
An implicit Crank–Nicolson procedure can be replaced with an explicit iteration process. An explicit finite‐difference time‐domain method based on the iterated Crank–Nicolson scheme that has been widely used for solving Einstein's equations is newly developed. The formulation is presented with two iterations and its stability condition is also derived. Numerical results are found to agree well with those obtained from the traditional explicit finite‐difference time‐domain method, showing the validity of the present iterated Crank–Nicolson–finite‐difference time‐domain method.

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