The proposed parallel QCRF-FDTD is validated in terms of the speedup fact and the computational accuracy. Second, this work presents a fast QCRF-FDTD algorithm by employing a parallel processing algorithm. First, this letter discusses two implementations of QCRF-FDTD to a zeroth-order temporal derivative term and it is observed that the numerical accuracy of the double averaging implementation is better than that of the direct implementation.
Finally, we analyze the shielding effectiveness of large-scale concrete structures by using our parallel QCRF-FDTD.ĪB - Recently, the quadratic complex rational function (QCRF) function was proposed for accurate finite-difference time-domain (FDTD) dispersive modeling. The finite difference time domain (FDTD) algorithm is derived from a finite difference equation (FDE) of Maxwell. Unfortunately, it is usually difficult if not impossible to find a Green’s function which satisfies the boundary conditions. N2 - Recently, the quadratic complex rational function (QCRF) function was proposed for accurate finite-difference time-domain (FDTD) dispersive modeling. The use of Green’s functions to solve inhomogeneous differential equations, such as the Maxwell’s equations with source currents is well known.
computational resources are being developed and improved really extremely fast. Producing exactly the same solution to Maxwells equations as Yees classic FDTD method, the fast FDTD method offers up to a 50 reduction in the number of multiplications, which is a very important indicator of the computational complexity of an algorithm. T1 - Parallel Dispersive FDTD Method Based on the Quadratic Complex Rational Function Finite Difference in Time Domain method (FDTD) is a well known numerical. In this short article we present a new fast finitedifference timedomain (FDTD) method.
0 kommentar(er)
