Research Article  Open Access
Yao Han, Hanru Shao, Jianfeng Dong, "Improved Generalized SingleSource Tangential Equivalence Principle Algorithm with ContactRegion Modeling Method for Array Structures", International Journal of Antennas and Propagation, vol. 2018, Article ID 9875041, 11 pages, 2018. https://doi.org/10.1155/2018/9875041
Improved Generalized SingleSource Tangential Equivalence Principle Algorithm with ContactRegion Modeling Method for Array Structures
Abstract
An improved generalized singlesource tangential equivalence principle algorithm (GSSTEPA) is proposed for analyzing array structures with connected elements. In order to use the advantages of GSSTEPA, the connected array elements are decomposed and computed by a contactregion modeling (CRM) method, which makes that each element has the same meshes. The unknowns of elements can be transferred onto the equivalence surfaces by GSSTEPA. The scattering matrix in GSSTEPA needs to be solved and stored only once due to the same meshes for each element. The shift invariant of translation matrices is also used to reduce the computation of nearfield interaction. Furthermore, the multilevel fast multipole algorithm (MLFMA) is used to accelerate the matrixvector multiplication in the GSSTEPA. Numerical results are shown to demonstrate the accuracy and efficiency of the proposed method.
1. Introduction
Surface integral equation (SIE) methods have been widely used in the simulation of complex electromagnetic phenomena in practical engineering. Application of SIE methods always leads to a dense matrix which limits its applicability. Many fast solvers have been developed to reduce the memory requirement and CPU time, such as fast multipole methods [1, 2], FFTbased methods [3, 4], lowrankbased methods [5–8], and direct solvers [9, 10]. However, for many multiscale electromagnetic problems, the dimension of the matrix is large and the matrix is illconditioned, which are still the challenges for the fast solvers. It is desirable for more efficient and robust SIE solutions to deal with those challenges.
In recent years, domain decomposition (DD) methods have been attracting much attention and regarded as effective techniques to solve multiscale systems. The DD methods rely on decomposing the problem into several smaller subdomains and solving each subdomain independently. In this manner, the dimension of the matrix can be reduced and the condition number of the matrix can be improved. Due to these advantages, the DD methods have been combined with finite element (FE) methods [11, 12] and finite difference (FD) methods [13, 14] successfully. To extend the DD methods to SIE methods, many studies have been proposed. Among these studies, several works are worth mentioning. The overlapping IEDDM [15] needs to construct buffer regions. The IEDDM in [16] uses artificial interfaces to do the decomposition. A nonoverlapping IEDDM [17] has been proposed by using the explicit boundary condition. The discontinuous Galerkin integral equation (IEDG) [18] has been formulated by employing an interior penalty term, which shows great flexibility to geometries. The equivalence principle algorithm (EPA) [19] is a kind of DD method based on Huygens’ principle. By using the virtual equivalence surfaces that enclose the subdomains, the EPA can isolate the subdomain from others. Then, the original unknowns of subdomains are transferred to the unknowns on the equivalence surfaces, which is different from the above methods. The linear embedding via Green’s operator (LEGO) [20] and generalized transition matrix (GTM) algorithm [21] are similar with EPA. However, the connected array structures have not been dealt with in those methods.
In this paper, the improved generalized singlesource tangential equivalence principle algorithm (GSSTEPA) is proposed to address the array structures with connected elements. Although the GSSTEPA has been developed to solve the connected structures [22], it is inefficient for the array structures. For the array structures with connected elements, if each element is decomposed as a subdomain and enclosed by the same equivalence surfaces, then the meshes of elements are different from each other. Therefore, the scattering matrix of each equivalence surface is different and needs to be solved and stored one by one, which leads to huge computational time and memory requirement. To overcome the above problem and make full use of the GSSTEPA, the contactregion modeling (CRM) [23] method is applied to make the decomposition for the array structures. Unlike many other DD methods, the CRM method automatically contains the boundary conditions for the contact surface between subdomains, so the additional transmission conditions are unnecessary. There are two major benefits of the proposed scheme: (a) Each element has the same meshes, so the scattering matrix of each equivalence surface is the same with each other and needs to be solved and stored only once, and (b) the shift invariant of translation matrices can be applied to reduce the computation of coupling between neighbor elements. Finally, the proposed method is accelerated by the multilevel fast multipole algorithm (MLFMA) [2].
2. The Domain Decomposition Based on the CRM Method
Without loss of generality, consider the scattering problem of a threedimensional dielectric domain with the media , as illustrated in Figure 1(a). The exterior region is the free space. The dielectric structure is illuminated by an incident plane wave . This problem can be solved by the commonly used PMCHWT formulation [24]. In this work, the CRM method is used for the domain partitioning. As shown in Figure 1(b), the dielectric domain is decomposed into two nonoverlapping subdomains such that . The surfaces of the subdomains and with outwarddirected unit normal and are denoted by and , respectively. As the distance , the solution of Figure 1(b) is the same as that of Figure 1(a) due to the same physics. Next, the variational PMCHWT formulation based on the CRM method is derived.
By using the extinction theorem, the total fields on the inner boundary of subdomain are equal to zero in the exterior equivalence situation. and are the equivalent electric and magnetic currents defined on the outer side of the surface . The EFIE and MFIE for subdomain can be expressed as where is the wave impedance in free space. denotes the inner side of . The operators and are defined as where is or , denotes the media domain, and and are the field surface and source surface, respectively. stands for the wave number in domain . is Green’s function defined as
PV stands for the Cauchy principle value integration. For the residue term , if the observation point resides on the outer side of , then “+” is chosen. Otherwise, “−” is taken if resides on the inner side of , while if is not on , the residue term should be equal to zero. Similarly, the EFIE and MFIE for subdomain in the exterior equivalence situation can be written as
For the interior equivalence situation, the total fields are zero on the outer boundary of . So the EFIE and MFIE for the are written as where
denotes the outer side of . In the domain , the EFIE and MFIE are
Combining (1) and (8), the PMCHWT Efield equation for surface can be derived as
The Hfield equation can be obtained by combining (2) and (9) as
Similarly, the PMCHWT Efield and Hfield equations for surface can be derived by combining (6) and (11) and (7) and (12), as follows:
Finally, the matrix form of these four PMCHWT equations is written as where is used to balance the magnitude of operators and make the matrix better conditioned.
3. Boundary Conditions at the Contact Surface in CRM
It is worth mentioning that the additional transmission conditions are unnecessary for the contact surface, because the continuity of the currents at the contact surface is contained in the above PMCHWT equations automatically. To prove this fact, a simple model is considered as shown in Figure 2. The surfaces of domains and are divided into four parts as and . In the exterior equivalence situation, the MFIE on the contact surfaces and are where
Because the surfaces and touch each other, the outer side of is the same as that of . Therefore, the terms , , , , and in (17) are equal to the terms , , , , and in (18). Since the operator does not have the residue term, the terms and are the same as and . By subtracting (18) from (17), the following can be obtained:
The definition of the operator can be found in (4). It can be seen that the Cauchy principle value integration in is the same as that in , while the residue terms are different. The terms and have similar relations. Therefore, (20) can be rewritten as
Since , then (21) can be derived as
It can be seen that the continuity of the electric currents at the contact surface is included in the MFIE. Similarly, the continuity of the magnetic currents at the contact surface can be derived from the EFIE equations.
4. GSSTEPA with the CRM Method
Consider the scattering of a dielectric object in free space. As shown in Figure 3, the object is decomposed into connected subdomains using the CRM method. Then, each subdomain is enclosed by an equivalence surface. The basic idea of GSSTEPA is to transform the original scattering problem into a new equivalent problem with a scattering operator and a translation operator. Next, the definitions of the scattering and translation operators are illustrated in the following.
The scattering operator can be derived from a dielectric object enclosed by an equivalence surface with three steps as shown in Figure 4. The three steps are outsidein propagation, solving for the currents on the object, and insideout propagation. The equivalence current on the equivalence surface generates the same scattered field as that generated by original currents on the object. Therefore, the scattering of a dielectric object can be characterized by the scattering operator as where subscripts and denote the equivalence surface and dielectric object separately. TEH means one type of the expressions between the incident current and the scattering current , which can be found in [25]. The dielectric object is solved by PMCHWT equations. The scattering operator can capture the full physics of the object, so the inside object can be removed.
The coupling between objects via the equivalence surfaces can be described by a translation operator. The translation operator has two different forms: one is suitable for nonadjacent cases, and the other is suitable for adjacent cases. For the two nonadjacent subdomains, the translation operator is quite simple. As shown in Figure 5, the subdomains and are enclosed by equivalence surfaces ES and ES separately. The coupling from ES to ES is the fields produced by the equivalent scattered current on ES , which can be expressed via a translation operator , , as
Therefore, the equivalence scattered current on ES is given by
The expression of the translation operator is similar as given above.
For the two adjacent subdomains, the translation operator can be derived by the source reconstruction method (SRM) [26–28]. As shown in Figure 6, the inside object has been decomposed into two subdomains with the distance . The coupling from ES to ES can be derived with several steps. Firstly, suppose the on ES is already known, then the equivalent electric current and magnetic current on the surface of dielectric can be obtained by using the SRM as where is the pseudoinverse. Secondly, once the equivalent currents on the surface of dielectric is obtained, the coupling from the dielectric to the dielectric can be solved using the CRM method as
Thirdly, the equivalent current produced by the incident fields and using the equivalence principle can be written as
Finally, by combing (27), (28), and (29), the equivalence scattered current is equal to where the translation operator is defined as the multiplication of several operators as
Since the scattering operator and translation operator have been derived, the GSSTEPA equations for the object in Figure 3 can be written as where
is the identity operator. The matrix form can be obtained by expanding the currents with the RaoWiltonGlisson (RWG) basis function and using Galerkin’s method to discretize the equations.
5. Computational Considerations
In this paper, the periodic array structures will be solved by the GSSTEPA. If the array elements are connected with each other, then the CRM method can be used to decompose the elements. Next, each element is enclosed by an equivalence surface. Due to the same geometry and meshes of each element and equivalence surface, the scattering operator is also the same with each other. Therefore, the scattering matrix needs to be solved and stored only once, which can reduce the computational time and memory requirement.
Since the array structures have a lot of elements, the MLFMA is used to accelerate the matrixvector multiplication in the GSSTEPA. It is notable that the translation operators have two different forms. The operator denotes the coupling between nonadjacent elements which can be calculated by MLFMA, while the operator denotes the nearfield coupling between adjacent elements that should be solved directly. Due to characteristic of the periodic array structure, the translation matrices are shift invariant which can be used to reduce the computation of nearfield coupling. As shown in Figure 7, it is easy to find that the eight kinds of nearinteraction mechanism between nine elements is a typical representation of different near interactions between all elements. In fact, the four corner elements in the array only have three kinds of near interactions. The edge elements have five kinds of near interactions. The other elements have eight kinds of near interactions. According to the shift invariant, these eight kinds of can be solved and stored only once, which can be used to reduce the calculation of any adjacent interactions.
6. Numerical Results
In this section, the performance of the proposed method is studied via several numerical experiments. All of the simulations are performed on PC with Intel Core i72760 2.4 GHz CPU and 32.0 GB memory.
Firstly, the accuracy of the CRM is investigated. The scattering of a dielectric sphere with and in free space is considered as shown in Figure 8(a). The sphere is partitioned into two subdomains (two hemispheres) with a fictitious contact surface by CRM as shown in Figure 8(b). The excitation is an polarized plane wave propagating into the negative direction at 300 MHz. The curvilinear RaoWiltonGlisson (CRWG) [29] is used to discretize the sphere surface. The bistatic radar cross section (RCS) of HH polarization is given in Figure 9. It can be seen that the result of CRM agrees very well with Mie series solution, which also proves that the decomposition does not change the physics of the original problem.
(a)
(b)
The second example is used to investigate the accuracy and convergence of the GSSTEPA with CRM. As shown in Figure 10, the dimension of the dielectric slab is . The relative permittivity and permeability of the slab are and . The excitation is an polarized plane wave propagating into the negative direction at 300 MHz. The slab is decomposed into , , and subdomains separately by CRM as shown in Figure 11. The subdomains have the same size as each other. Then, each subdomain is enclosed by an equivalence surface with the same size. The sizes of each equivalence surface are , , and for the three different decompositions separately, which means the distance between the subdomain and the equivalence surface is . Since each subdomain and each equivalence surface have the same size, the same meshes for each subdomain and each equivalence surface can be constructed. Therefore, the scattering matrix in GSSTEPA only needs to be calculated only once. The bistatic RCS of HH polarization is given in Figure 12, which shows good accuracy of GSSTEPA with CRM using different decomposition schemes. Figure 13 shows the comparison of the iteration number among the three different decompositions in GSSTEPA. The generalized minimal residual (GMRES) method with the tolerance 10^{−6} is used to solve the final equations. With the increase in subdomains, the iteration number only grows from 20 to 25, which shows the convergence stability of the method, while the PMCHWT equations converge to 10^{−6} with 1219 steps.
(a)
(b)
(c)
The third example is a bowtie antenna array located in the xy plane. The dimension of a bowtie antenna element is shown in Figure 14(a). The yellow part is the PEC patch, while the red part is the dielectric substrate. The thickness of the antenna substrate is 0.03 m with and . The elements are connected with each other. The array is divided into 9 subdomains by CRM, which means that each element is a subdomain. Then, each element is enclosed by an equivalence surface as shown in Figure 14(b). The excitation is an polarized plane wave propagating into the negative direction at 1.0 GHz. Because the element is a composite target, the EFIEPMCHWT is used to solve the element. As shown in Figure 15, the bistatic RCS of GSSTEPA agrees very well with that of EFIEPMCHWT. The comparison of computational results is given in Table 1. Because the number of unknowns on the equivalence surfaces is much less than that on the element surfaces, GSSTEPA can reduce the solution time and memory requirement significantly. It is well known that EFIEPMCHWT is accurate but suffers from poor spectrum property. By transferring the unknowns on the element surfaces to the unknowns on the equivalence surfaces, GSSTEPA with CRM can improve the spectrum property of EFIEPMCHWT significantly.
(a)
(b)

Finally, to investigate the capability of GSSTEPA with CRM to solve large array structures, the scattering of the bowtie antenna array is solved. The parameters of the array are the same as that in the above example, except for the number of elements. The total number of unknowns of the equivalence surfaces is 41,850. The MLFMA is applied to accelerate the calculation of the coupling between nonadjacent elements. The bistatic RCS of HH polarization is given in Figure 16. The total solution time is 1972.6 s, and memory consumption is 3.9 GB. GSSTEPA converges to 10^{−3} using 74 iteration steps. It can be seen that GSSTEPA still exhibits fast convergence as the increment of the element number.
7. Conclusions
In this paper, GSSTEPA with the CRM method is introduced to solve the array structures with connected elements. Firstly, the array structures are decomposed into subdomains by CRM. Then, the unknowns on the subdomains are transferred to the unknowns on the equivalence surfaces by GSSTEPA. Moreover, the meshes of subdomains can be the same with each other, which makes the scattering matrix solved and stored only once. The shift invariant of translation matrices is also used according to the characteristic of array structures. Using this strategy, the number of unknowns can be reduced and the conditioning of the final matrix equation is significantly better than the traditional PMCHWT and EFIEPMCHWT. Therefore, the improved GSSTEPA can be viewed as an efficient and robust solver to solve array structures.
Conflicts of Interest
The authors declare that there is no conflict of interest regarding the publication of this paper.
Acknowledgments
This work is supported by National Natural Science Foundation of China (Grant nos. 61501267, 61631012, 61671257, and 61425010), Natural Science Foundation of Zhejiang Province (Grant no. LQ16F010003), and Ningbo University Discipline Project (Grant nos. XKL14D2058 and XYL15008) and is partially sponsored by a K.C. Wong Magna Fund in Ningbo University.
References
 V. Rokhlin, “Rapid solution of integral equations of scattering theory in two dimensions,” Journal of Computational Physics, vol. 86, no. 2, pp. 414–439, 1990. View at: Publisher Site  Google Scholar
 J. M. Song and W. C. Chew, “Multilevel fastmultipole algorithm for solving combined field integral equations of electromagnetic scattering,” Microwave and Optical Technology Letters, vol. 10, no. 1, pp. 14–19, 1995. View at: Publisher Site  Google Scholar
 E. Bleszynski, M. Bleszynski, and T. Jaroszewicz, “AIM: adaptive integral method for solving largescale electromagnetic scattering and radiation problems,” Radio Science, vol. 31, no. 5, pp. 1225–1251, 1996. View at: Publisher Site  Google Scholar
 S. M. Seo and J.F. Lee, “A fast IEFFT algorithm for solving PEC scattering problems,” IEEE Transactions on Magnetics, vol. 41, no. 5, pp. 1476–1479, 2005. View at: Publisher Site  Google Scholar
 J. M. Rius, J. Parron, E. Ubeda, and J. R. Mosig, “Multilevel matrix decomposition algorithm for analysis of electrically large electromagnetic problems in 3D,” Microwave and Optical Technology Letters, vol. 22, no. 3, pp. 177–182, 1999. View at: Publisher Site  Google Scholar
 W. Hackbusch and B. Khoromskij, “A sparse matrix arithmetic based on Hmatrices. Part I: introduction to Hmatrices,” Computing, vol. 62, no. 2, pp. 89–108, 1999. View at: Publisher Site  Google Scholar
 K. Zhao, M. N. Vouvakis, and J.F. Lee, “The adaptive cross approximation algorithm for accelerated method of moments computations of EMC problems,” IEEE Transactions on Electromagnetic Compatibility, vol. 47, no. 4, pp. 763–773, 2005. View at: Publisher Site  Google Scholar
 H. Guo, J. Hu, H. Shao, and Z. Nie, “Hierarchical matrices method and its application in electromagnetic integral equations,” International Journal of Antennas and Propagation, vol. 2012, Article ID 756259, 9 pages, 2012. View at: Publisher Site  Google Scholar
 J. Shaeffer, “Direct solve of electrically large integral equations for problem sizes to 1 M unknowns,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 8, pp. 2306–2313, 2008. View at: Publisher Site  Google Scholar
 W. Chai and D. Jiao, “An LU decomposition based direct integral equation solver of linear complexity and higherorder accuracy for largescale interconnect extraction,” IEEE Transactions on Advanced Packaging, vol. 33, no. 4, pp. 794–803, 2010. View at: Publisher Site  Google Scholar
 Y. J. Li and J. M. Jin, “A new dualprimal domain decomposition approach for finite element simulation of 3D largescale electromagnetic problems,” IEEE Transactions on Antennas and Propagation, vol. 55, no. 10, pp. 2803–2810, 2007. View at: Publisher Site  Google Scholar
 Z. Peng and J.F. Lee, “Nonconformal domain decomposition method with secondorder transmission conditions for timeharmonic electromagnetics,” Journal of Computational Physics, vol. 229, no. 16, pp. 5615–5629, 2010. View at: Publisher Site  Google Scholar
 Y. Lu and C. Y. Shen, “A domain decomposition finitedifference method for parallel numerical implementation of timedependent Maxwell’s equations,” IEEE Transactions on Antennas and Propagation, vol. 45, no. 3, pp. 556–562, 1997. View at: Publisher Site  Google Scholar
 L. Yin and W. Hong, “A fast algorithm based on the domain decomposition method for scattering analysis of electrically large objects,” Radio Science, vol. 37, no. 1, pp. 3–9, 2002. View at: Publisher Site  Google Scholar
 W. D. Li, W. Hong, and H. X. Zhou, “Integral equationbased overlapped domain decomposition method for the analysis of electromagnetic scattering of 3D conducting objects,” Microwave and Optical Technology Letters, vol. 49, no. 2, pp. 265–274, 2007. View at: Publisher Site  Google Scholar
 Z. Peng, X. C. Wang, and J.F. Lee, “Integral equation based domain decomposition method for solving electromagnetic wave scattering from nonpenetrable objects,” IEEE Transactions on Antennas and Propagation, vol. 59, no. 9, pp. 3328–3338, 2011. View at: Publisher Site  Google Scholar
 K.L. Zheng, H.X. Zhou, and W. Hong, “Integral equationbased nonoverlapping DDM using the explicit boundary condition,” IEEE Transactions on Antennas and Propagation, vol. 63, no. 6, pp. 2739–2745, 2015. View at: Publisher Site  Google Scholar
 Z. Peng, K. H. Lim, and J.F. Lee, “A discontinuous Galerkin surface integral equation method for electromagnetic wave scattering from nonpenetrable targets,” IEEE Transactions on Antennas and Propagation, vol. 61, no. 7, pp. 3617–3628, 2013. View at: Publisher Site  Google Scholar
 M. K. Li, W. C. Chew, and L. J. Jiang, “A domain decomposition scheme based on equivalence theorem,” Microwave and Optical Technology Letters, vol. 48, no. 9, pp. 1853–1857, 2006. View at: Publisher Site  Google Scholar
 A. M. van de Water, B. P. de Hon, M. C. van Beurden, A. G. Tijhuis, and P. de Maagt, “Linear embedding via Green’s operators: a modeling technique for finite electromagnetic bandgap structures,” Physical Review E, vol. 72, no. 5, 2005. View at: Publisher Site  Google Scholar
 G. Xiao, J. Mao, and B. Yuan, “Generalized transition matrix for arbitrarily shaped scatterers or scatterer groups,” IEEE Transactions on Antennas and Propagation, vol. 56, no. 12, pp. 3723–3732, 2008. View at: Publisher Site  Google Scholar
 H. Shao, J. Dong, and J. Hu, “Full wave modeling of array structures using generalized singlesource tangential equivalence principle algorithm,” International Journal of Antennas and Propagation, vol. 2017, Article ID 4903906, 10 pages, 2017. View at: Publisher Site  Google Scholar
 Y. Chu, W. C. Chew, J. Zhao, and S. Chen, “A surface integral equation formulation for lowfrequency scattering from a composite object,” IEEE Transactions on Antennas and Propagation, vol. 51, no. 10, pp. 2837–2844, 2003. View at: Publisher Site  Google Scholar
 T. K. Wu and L. L. Tsai, “Scattering from arbitrarilyshaped lossy dielectric bodies of revolution,” Radio Science, vol. 12, no. 5, pp. 709–718, 1977. View at: Publisher Site  Google Scholar
 H. Shao, J. Dong, and J. Hu, “Improving the accuracy of singlesource equivalence principle algorithm by using tangential field projection scheme,” Electromagnetics, vol. 36, no. 8, pp. 534–545, 2016. View at: Publisher Site  Google Scholar
 H. Shao and J. Hu, “Analysis of connected structures using equivalence principle algorithm with source reconstruction method,” Journal of Electromagnetic Waves and Applications, vol. 30, no. 13, pp. 1740–1754, 2016. View at: Publisher Site  Google Scholar
 P. Petre and T. K. Sarkar, “Planar nearfield to farfield transformation using an array of dipole probes,” IEEE Transactions on Antennas and Propagation, vol. 42, no. 4, pp. 534–537, 1994. View at: Publisher Site  Google Scholar
 P. Li and L. J. Jiang, “Source reconstruction methodbased radiated emission characterization for PCBs,” IEEE Transactions on Electromagnetic Compatibility, vol. 55, no. 5, pp. 933–940, 2013. View at: Publisher Site  Google Scholar
 R. D. Graglia, D. R. Wilton, and A. F. Peterson, “Higher order interpolatory vector bases for computational electromagnetics,” IEEE Transactions on Antennas and Propagation, vol. 45, no. 3, pp. 329–342, 1997. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2018 Yao Han 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.