Research Article  Open Access
DaWei Zhu, HaiLin Chen, ZiYu Pan, BoAo Xu, Bin Chen, "An Efficient LaguerreBased FDTD Iterative Algorithm in 3D Cylindrical Coordinate System", International Journal of Antennas and Propagation, vol. 2019, Article ID 9542976, 14 pages, 2019. https://doi.org/10.1155/2019/9542976
An Efficient LaguerreBased FDTD Iterative Algorithm in 3D Cylindrical Coordinate System
Abstract
Here an efficient Laguerrebased finitedifference timedomain iterative algorithm is proposed. Different from the previously developed iterative procedure used in the efficient FDTD algorithm, a new perturbation term combined with the Gaussâ€“Seidel iterative procedure is introduced to form the new Laguerrebased FDTD algorithm in the 3D cylindrical coordinate system. Such a treatment scheme can reduce the splitting error to a low level and obtain a good convergence; in other words, it can improve the efficiency and accuracy than other algorithms. To verify the performance of the proposed algorithm, two scattering numerical examples are given. The computation results show that the proposed algorithm can be better than the ADIFDTD algorithm in terms of efficiency and accuracy. Meanwhile, the proposed algorithm is extremely useful for the problems with fine structures in the 3D cylindrical coordinate system.
1. Introduction
In recent years, the unconditionally stable Laguerrebased finitedifference timedomain (FDTD) algorithm has been applied to simulate transient electromagnetic problems in the Cartesian coordinate. By transforming the timedomain problem to the Laguerre domain using the temporal Galerkinâ€™s testing procedure, the transient solution is independent of time discretization. Thus, Laguerrebased FDTD formulation has the advantage of less numerical error when a larger time step is used.
The main drawback of the conventional Laguerrebased FDTD algorithm is that it requires solving a very large sparse matrix. To overcome this problem, a factorizationsplitting scheme [1] was used to resolve the huge sparse matrix into six tridiagonal matrixes, and then the chasing method was used to solve them [2]. This provided excellent computational accuracy and can be efficiently parallelprocessed on a computing cluster. To further reduce the splitting error, the modified perturbation term was introduced in [3, 4]; meanwhile, the Gaussâ€“Seidel iterative procedure was applied, which made the new Laguerrebased FDTD scheme more efficient and accurate. Obviously, the good feasibility of the efficient Laguerre scheme had been conformed in the rectangular coordinate system.
However, in many applications, we have to deal with 3D cylindrical structures such as in optical fiber communication, integrated optics, and defense industry. Moreover, the geometry of interest may consist of fine structures. If we adopt the conventional FDTD method to discretize the cylindrical structure with the Cartesian grid, a significant staircasing error appears. In fact, due to the existence of the term in the 3D cylindrical coordinate system, the decomposition of the fields along the direction will lead the splitting error. How to reduce this kind of error in the iterative FDTD calculation has become a difficult problem. In addition, how to conduct direction transformation of the fields on the zaxis is also a research difficult in the 3D cylindrical coordinate system. Perhaps this is why, since 2000, the FDTD method has done little applications in the 3D cylindrical coordinate system. There is not even an article on the Laguerre technology.
Therefore, in order to expand the research field of the FDTD method, we propose an efficient Laguerrebased finitedifference timedomain iterative algorithm in the 3D cylindrical coordinate system. Firstly, according to the ideology of the weighted Laguerre polynomial (WLP) FDTD scheme, the WLPFDTD equations of the proposed algorithm in the 3D cylindrical coordinate system are deduced by introducing the new perturbation term and the nonphysical intermediate variables. Secondly, the field components on the zaxis are amended with special treatment. Finally, to verify the proposed algorithm, two scattering numerical examples are given. Numerical results show that the proposed algorithm can be better than the ADIFDTD algorithm [5] in terms of efficiency and accuracy.
2. Iterative Theory and Formulations
2.1. WLPFDTD Equations in 3D Cylindrical Coordinate System
Introducing the WLP technology [6] into Maxwellâ€™s equations of the 3D cylindrical coordinate [7], one can obtain the equations of the conventional WLPFDTD in the 3D cylindrical coordinate system, directly:where is a timescale factor, is the order of weighted Laguerre polynomials, and and are the electric and magnetic permeability, respectively.
2.2. Iterative Equations for the OffAxis Fields
Equations (1)â€“(6) can be written in the following matrix form:where and are the general form of WLP fields and the summation of order WLP fields, respectively, and and are the coefficient matrices.
Obviously, solving equation (7) must involve large sparse matrix problems, and it is impossible to solve it. Therefore, the efficient algorithm must be adopted to avoid the direct solution of the large sparse matrix.
Referring to the brief form of the 3D FDTD equation in [4], when the excitation sources are added, the equations of the efficient Laguerrebased FDTD in the 3D cylindrical coordinate can be rewritten aswhere is the iteration and equations (8) and (9) are the initial and iterative computation, respectively. Clearly, (9) have the same form with (8). So, one can combine them as follows:where
In addition, the and in (10b) should bewhere and . , , and are the firstorder central difference operators along , , and axes, respectively.
In fact, equation (10a) can be implemented by simple programming, and we only need to implement the design of the iterative calculation. Therefore, we actually only need to introduce the perturbation term in [4] into equation (7) to obtain (10b), and the advantage of this is that it greatly simplifies the programming process and improves the computational efficiency.
In accordance with the design theory of the proposed algorithm in this paper, we introduce the nonphysical intermediate variables , and it can divide (10b) into
Expanding (13a) and (13b), one can obtain
Substituting (14b) into (14a), one can obtain
Expanding (16), one can obtain three implicit equations , , and . Here, the Gaussâ€“Seidel iterative procedure should be used, and the equations after the Gaussâ€“Seidel procedure are
Obviously, the necessary nonphysical variables , , and for solving (15a) have been obtained through solving (17a)â€“(17c).
Next is how to solve the fields of the nonphysical variables for solving (15b). Here, it is not necessary because substituting (14b) into (15b), equation (15b) can be rewritten as
Clearly, the nonphysical variables are eliminated already. Meaning that, the nonphysical variables do not have to be solved in the whole iteration.
Substituting (18) into (15a), one can obtain a new equation which is similar with (16):
Expanding (18) and (19), one can obtain the computational equations of the electric and magnetic fields of the proposed algorithm:where
At this point, the implementation scheme of the proposed algorithm has been elaborated, and the overall execution process is described in Figure 1.
3. Special Treatment for the OnAxis Fields
3.1. Theory and Analysis of the Special Treatment for the OnAxis Field Components
Because of the strangeness of the cylindrical coordinate system, drastic change of the field nearby the axis will lead the splitting error to be great [8]. Therefore, onaxis fields need to be specially treated in the 3D cylindrical coordinate system.
The positions of the electric/magnetic fields of the 3D cylindrical coordinate are shown in Figure 2, deducting the fields nearby the axis, and the section is a partial circular ring. Seeing the black shadow sector in Figure 3, clearly, the section can be added by many sectors. That is to say, all the electric/magnetic fields on the axis exhibit mathematical strangeness. As shown in Figure 3, when , there are and field components on the axis; therefore, we should treat and specially.
According Stokesâ€™s theorem, we start from the following integral form of Maxwellâ€™s equations in the time domain:where is a closed curve surrounding the axis and is the surface bounded by the curve . Equations (26) and (27) are actually the integral form of the Ampere loop theorem.
3.2. Differentia of the Special Treatment for the OnAxis Field Components in 3D Cylindrical Coordinate System
The FDTD difference equation of can be derived from the formula (26), its integral area is the dotted line circle, and the radius is , as shown in Figure 3:noting .
Obviously, the form of the right side of equation (28) is different from equations (17a)â€“(17c2) in [9]. Supposing in equation (28) is calculated in a body of revolution structure and each is equal for all the different values, equation (28) can be modified aswhere .
In this way, the form of the right side of equation (29) is similar with (17a)â€“(17c2) in [9]. By comparing equations (28) and (29), we can explain the different characteristics of the special treatment scheme on the axis in the 3D cylindrical coordinate structure, which is clearly distinguished from the scheme in the body of the revolution structure.
3.3. Special Treatment of and
Introducing the WLP technology [6] into equation (28), one can obtain
In order to solve equation (30), we present the firstorder FDTD central difference expansion of equation (24) at :
Substituting (31) into (30), one can obtain the special treatment equation of in the 3D cylindrical coordinate system:
In a similar way, the FDTD difference equation of can be derived from formula (27), its integral area is the dotted line circle, and the radius is , as shown in Figure 3. Its method of obtaining can refer to equations (30) to (32).
Obviously, when , the expansion form of equation (25) is consistent with ; therefore, the special treatment of is not necessary.
4. Numerical Results
In order to verify the performance of the proposed algorithm, two scattering numerical examples are given.
First example: an irregular scatter with two grooves is calculated, and the angle of the groove is . The radius of the groove is 19â€‰cm, and the radius and height of the cylinder are 20â€‰cm and 40â€‰cm, respectively. The oblique incident plane wave is added through Huygenâ€™s surface at and , and parallel to the plane, the incident angle is , as shown in Figure 4. The incident electric field iswhere , , , and . And and are chosen for the computation of the field values. The computational domain is meshed using a uniform grid with , leading to the total mesh of , and the firstorder Mur absorbing boundary condition is used to truncate the boundary [10].
The observation points of the simulated electric fields are set at , , and , and the iteration of the whole computational domain is denoted Nt. By using the conventional FDTD algorithm, the ADIFDTD algorithm [5], and the proposed algorithm, the timedomain field waveforms are shown in Figures 5â€“7. The numerical results show an excellent agreement between the conventional FDTD and the proposed algorithms.
In addition, to demonstrate the higher accuracy of the proposed algorithm, here two error formulations are provided to describe the accuracy, which are defined aswhere are the simulation results of the electric fields of the ADIFDTD algorithm and the proposed algorithm and is the simulation result of the conventional FDTD algorithm.
Figures 8â€“10 afford the error about E of the proposed algorithm (with Ntâ€‰=â€‰3). Clearly, the error of the proposed algorithm is much smaller than the ADIFDTD algorithm (with , , and , ). The CPU time of the ADIFDTD algorithm and the proposed algorithm is shown in Table 1.

Observing Figures 8â€“10 and Table 1, when the proposed algorithm Ntâ€‰=â€‰3 and the ADIFDTD algorithm , the CPU time of both algorithms is almost equal; nevertheless, the error of the proposed algorithm can be reduced almost 64% than the ADIFDTD algorithm at least. Even though, when the ADIFDTD , the comparing results show that the error of the proposed algorithm can be reduced almost 44% at least and the CPU time can be saved almost 35% than the ADIFDTD algorithm. Obviously, the proposed algorithm can provide better improvement in terms of efficiency and accuracy.
Second example: another irregular scatter with one wedgeshaped bulge is shown in Figure 11: the angle of the bulge is , the radius of the bulge is 22â€‰cm, and the radius and height of the cylinder are 20â€‰cm and 40â€‰cm, respectively. The other conditions are same with the first example.
The observation points of simulated electric fields are set at , , and , respectively. The waveforms of the proposed algorithm are shown in Figures 12â€“14, which also form an excellent agreement with the conventional FDTD algorithm.
To demonstrate the accuracy of the proposed algorithm again, formulations (341) and (342) are used again here. Figures 15â€“17 afford the error about E of the proposed algorithm (with Ntâ€‰=â€‰3) and the ADIFDTD algorithm (with , , and ). The CPU time of the both algorithms is shown in Table 2.

Observing Figures 15â€“17 and Table 2, when the proposed algorithm Ntâ€‰=â€‰3 and the ADIFDTD algorithm (with , and ), the comparison results are similar with the first example, namely, the efficiency and the accuracy of the proposed algorithm are still better than the ADIFDTD algorithm. Obviously, the second example numerical results verify that the proposed algorithm can provide better improvement than the ADIFDTD algorithm [5] in terms of efficiency and accuracy again.
5. Conclusion
In this paper, an efficient Laguerrebased finitedifference timedomain iterative algorithm in the 3D cylindrical coordinate system is proposed. By adopting a new perturbation term and using the Gaussâ€“Seidel iterative procedure method in the iterative algorithm of this paper, this kind of treatment can get better convergence; meanwhile, it also can ensure the enhancing of the efficiency and accuracy. It can be proved by computing the two scattering numerical examples that the proposed algorithm can provide better efficiency and accuracy in highfrequency range than the ADIFDTD algorithm.
Data Availability
The simulation data for the 3D cylindrical coordinate structure used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work was supported in part by the National Science Research Foundation of Institutions of Higher Learning in Jiangsu Province of China under Grant 18KJB510017, UniversityLevel Science Foundation of Nanjing Insititute of Technology under Grant ZKJ201801, and National Science Foundation of China under Grant 51477182.
References
 G. Sun and C. W. Trueman, â€śEfficient implementations of the CrankNicolson scheme for the finitedifference timedomain method,â€ť IEEE Transactions on Microwave Theory and Techniques, vol. 54, no. 5, pp. 2275â€“2284, 2006. View at: Publisher Site  Google Scholar
 Y.T. Duan, B. Chen, D.G. Fang, and B.H. Zhou, â€śEfficient implementation for 3D laguerrebased finitedifference timedomain method,â€ť IEEE Transactions on Microwave Theory and Techniques, vol. 59, no. 1, pp. 56â€“64, 2011. View at: Publisher Site  Google Scholar
 Z. Chen, Y.T. Duan, Y.R. Zhang, H.L. Chen, and Y. Yi, â€śA new efficient algorithm for 3D laguerrebased finitedifference timedomain method,â€ť IEEE Transactions on Antennas and Propagation, vol. 62, no. 4, pp. 2158â€“2164, 2014. View at: Publisher Site  Google Scholar
 B. Zhang, Y. Yi, Y. T. Duan, Z. Chen, and B. Chen, â€śA new iterative algorithm for efficient 3D laguerrebased FDTD method,â€ť IEEE Antennas and Wireless Propagation Letters, vol. 15, pp. 662â€“665, 2016. View at: Publisher Site  Google Scholar
 Y. G. Wang, B. Chen, H. L. Chen, Y. Yi, and X. L. Kong, â€śOnestep leapfrog ADIFDTD method in 3D cylindrical grids with a CPML implementation,â€ť IEEE Antennas and Wireless Propagation Letters, vol. 13, pp. 714â€“717, 2014. View at: Publisher Site  Google Scholar
 Y. S. Chung, T. K. Sarkar, B. H. Jung, and M. SalazarPalma, â€śAn unconditionally stable scheme for the finitedifference timedomain method,â€ť IEEE Transactions on Microwave Theory and Techniques, vol. 51, no. 3, pp. 697â€“704, 2003. View at: Publisher Site  Google Scholar
 N. Dib, T. Weller, and M. Scardelletti, â€śAnalysis of 3D cylindrical structures using the finite difference timedomain method,â€ť in Proceedings of the 1998 IEEE MTTS International Microwave Symposium Digest, pp. 925â€“928, May 1998. View at: Publisher Site  Google Scholar
 A. Taflove and S. C. Hagness, Computational Electrodynamics: The FiniteDifference TimeDomain Method, Artech House, Boston, MA, USA, 2nd edition, 2000.
 H. L. Chen, B. Chen, Y. T. Duan, Y. Yi, and D. G. Fang, â€śUnconditionally stable laguerrebased BORFDTD scheme for scattering from bodies of revolution,â€ť Microwave and Optical Technology Letters, vol. 49, no. 8, pp. 1897â€“1900, 2007. View at: Google Scholar
 G. Mur, â€śAbsorbing boundary conditions for the finitedifference approximation of the timedomain electromagneticfield equations,â€ť IEEE Transactions on Electromagnetic Compatibility, vol. EMC23, no. 4, pp. 377â€“382, 1981. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2019 DaWei Zhu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.