- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
International Journal of Antennas and Propagation
Volume 2013 (2013), Article ID 480790, 6 pages
A Method for Fast Generating the VIE-MoM Matrix with the SWG Functions
State Key Laboratory of Millimeter Waves, Southeast University, Nanjing 210096, China
Received 3 April 2013; Revised 19 July 2013; Accepted 2 August 2013
Academic Editor: Safieddin Safavi-Naeini
Copyright © 2013 Shu-Wen Chen 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.
A method for fast generating the VIE-MoM matrix with the SWG functions is proposed. This method makes the integrals representing the shared data independent of any quadratures and hence can ensure both the efficiency and accuracy. In the VIE-MoM, the time cost of filling the VIE-MoM matrix is prominent especially for an electrically large object. With the proposed method, the time cost of filling the VIE-MoM matrix can be reduced by about 85% compared with the traditional basis-basis matching method. Numerical examples are provided to demonstrate the efficiency and accuracy of the proposed method.
Study of electromagnetic scattering characteristic of 3D inhomogeneous dielectric objects has significance in many important fields . The method of moments (MoM)  is frequently used to solve electromagnetic scattering problems. No matter based on the surface integral equation (SIE)  or on the volume integral equation (VIE) , the MoM matrixes are always dense. Therefore, filling the MoM matrix will consume a large amount of CPU time especially for an electrically large object.
For the VIE-MoM with the Schauert-Wilton-Glisson (SWG) functions, Schaubert et al. did prophecy in . Considerable savings in computation time can be achieved by expressing the VIE-MoM matrix elements into four independent scalar integrals over each tetrahedron. But so far, there is no publication for the concrete realization of this vision. For the SIE-MoM with the Rao-Wilton-Glisson (RWG) functions , Zhang proposed a triangle-triangle scheme in  to accelerate filling the SIE-MoM matrix. The interactions between a pair of triangle patches associate with up to 9 matrix elements, which is the foundation of the triangle-triangle scheme. Zhang's method has many applications [6–9]. Actually, the ideas of both Schauert and Zhang are similar and rely on using the midpoint formula for the testing integrals. However, the midpoint formula cannot reach the required accuracy in many practical problems.
In this paper, a method for fast generating the VIE-MoM matrix with the SWG functions is proposed. This method makes the integrals representing the shared data independent of any quadratures and hence can ensure both the efficiency and accuracy. With the proposed method, the time cost of filling the VIE-MoM matrix can be reduced by about 85% compared with the traditional basis-basis matching method. Numerical examples are provided to demonstrate the efficiency and accuracy of the proposed method.
2. Integral Formulae of the VIE-MoM Matrix Elements
2.1. The Volume Integral Equation
Let denote the volume domain of an inhomogeneous dielectric object with a relative permittivity and a relative permeability . The permittivity and the permeability of the free space are and , respectively. Let be the incident field and the scattered field; then the total field can be expressed as the sum of and :
The scattered field due to the volume polarization current in can be written as where
2.2. Building the MoM Model
The electric flux density can be selected as the unknown function because it is continuous along the normal of the medium interface of .
After being discretized by tetrahedra, can be expanded with the SWG functions as follows: where is defined on a pair of tetrahedra as whose geometry is shown in Figure 1. The details about the SWG functions are referred to in . It should be noted that, for modeling at the outer boundary of , the so-called half-SWG functions are also needed.
Filling the matrix by using (7) (the basis-basis scheme) includes a lot of redundant calculations. This disadvantage can be overcome by the new method presented in the following.
2.3. Fast Filling the VIE-MoM Matrix
Rewrite (7) as wherewhere is the outer surface of and represents the unit outward normal vector of .
Usually, consists of two tetrahedron subdomains; that is, In such a case, is called a complete support set, and consists of 6 triangle subsurfaces. It is readily known that if is complete, all the integrals in (10a)–(10f) having as their integration regions are equal to zero. When or , is called an incomplete support set or a half support set. Clearly, when is incomplete, consists of 4 triangle subsurfaces. In such a case, every integral in (10a)–(10f) having as its integration region can be reduced as one on the triangle sub-surface of (see Figure 1).
It can be found that every integral in (10a)–(10d) and (10f) for a fixed element includes a lot of calculations shared by other elements. Removing these redundant calculations can greatly improve the filling efficiency of the matrix. Here, we consider only (10b), and the others will be presented in the appendix.
Without loss of generality, we assume that both and are complete; then where has and as its outer and inner integration regions, respectively. The calculation formulae of the four terms in the right hand of (12) are very analogous, so only one needs to be provided. For doing this, we now consider After expanding , we obtain where
Note that the formulae (15a)–(15d) are only related with the global numbers of the tetrahedra and . Therefore, these numerical results can be shared by multiple matrix elements, which is the reason why the redundant calculations can be removed. Generally, the interactions between a pair of tetrahedra associate with up to 16 matrix elements.
Similar analysis can also be done for the remaining integrals in (10a)–(10f), and the corresponding calculation formulae are listed in the appendix. In most cases, in the MoM model discussed, triangle subdomains are far less than tetrahedron subdomains, and hence calculation amount corresponding to the formulae (10c), (10e), and (10f) is much less than that of the formulae (10a), (10b), and (10d). Therefore, the time cost related with , , and is particularly prominent.
It should be pointed out that the formulae (15a)–(15d), –, , , , , and provide the shared data for the corresponding matrix elements and are independent of any quadratures. Therefore, the proposed method can ensure both the efficiency and accuracy.
3. Testing the Efficiency
In this section, three examples are provided to test the efficiency of the presented method. The symmetric quadrature with 4 integral points is applied to each integral on tetrahedra, and the symmetric quadrature with 3 integral points is applied to each integral on triangles. The computations include the serial computation and the parallel computation based on OpenMP . It is assumed that the excitation is plane wave that has the propagation direction along the positive -axis and the polarization direction in the -axis. Also, always denotes the wavelength in the free space.
Example A (homogeneous ball). A homogeneous ball with the relative permittivity 2.0 is considered. The radius of the ball is . The volume domain is discretized by 4291 tetrahedra, and the number of unknowns is 8925.
The bistatic RCS curves for the fixed angle are shown in Figure 2. It can be seen from Figure 2 that the results from the MoM using the proposed method, the MoM using the basis-basis scheme, and the Mie series  are consistent, which implies that our computer program is correct. Time cost comparison is recorded in Table 1 (the part with A).
Example B (partitioned homogeneous cuboid). A partitioned homogeneous cuboid with 3 different materials is considered in Figure 3(a). The volume domain is discretized by 2511 tetrahedra, and the number of unknowns is 5312. Time cost comparison is recorded in Table 1 (the part with B).
Example C (inhomogeneous cube). An inhomogeneous cube is considered in Figure 3(b). The relative permittivity of the cube varies according to
The volume domain is discretized by 1635 tetrahedra, and the number of unknowns is 3486. Time cost comparison is recorded in Table 1 (the part with C).
It can be seen from the above examples that the efficiency of the proposed method is very satisfactory whether in serial computation case or in parallel computation case. With the proposed method in this paper, the time cost of filling VIE-MoM matrix is reduced by about 85% compared with the traditional basis-basis scheme.
4. Testing the Accuracy
The proposed method makes the integrals representing the shared data independent of any quadratures and hence can be easily combined with the proper quadratures to achieve better numerical accuracy. We will verify this fact by using quadratures of different algebraic degrees (or orders).
Symmetric quadrature rules on triangles and tetrahedra will be adopted . For brevity, we will only mention the algebraic degrees on tetrahedra. The MoM matrix calculated by using the quadrature of algebraic degree 14 (contains 236 points) on the tetrahedron is regarded as the benchmark. The relative error (RE) of the MoM matrix is defined by where denotes the Frobenius norm of the matrix  and the superscript “AM” means “approximation matrix” calculated by quadratures of lower algebraic degrees.
Here, the homogeneous ball with the relative permittivity 2.0 in Example A is considered once again. The REs obtained by using quadratures of different algebraic degrees are recorded in Table 2. It can be clearly seen from Table 2 that the accuracy of the MoM matrix can be improved with increasing the algebraic degree of the quadrature.
It should be pointed out that the amount of memory required by the MoM matrix (1215.45 MB in this example) itself is not changed due to the application of fast filling scheme. The interactions between one pair of tetrahedron subdomains can contribute to up to 16 matrix elements, and the calculations of shared data need to be temporarily stored, such as the values of Green's function, which requires proper auxiliary memory. In each thread, each time, the interactions between only one pair of tetrahedron subdomains need small storage in which the part required by the values of Green's function is dominant, and this small storage can be evaluated as bytes when using double precision, where is the number of integral points on a tetrahedron subdomain. Clearly, this small storage can be ignored compared with the amount of storage required by the MoM matrix. Besides, when the algebraic degree of the quadrature is increased, the auxiliary storage for helping the fast calculation will be increased, but the acceleration effect will be more apparent due to shared data increase.
In this paper, a fast method for generating the VIE-MoM matrix using the SWG functions has been presented in details. By means of the inherent structure property of the SWG functions, those integrals having tetrahedra and/or triangles as their outer or inner integration regions can be rewritten as a sum of several terms that include integrals which can be shared by many matrix elements, significantly reducing time cost of filling the VIE-MoM matrix.
The prominent feature of the proposed method is that the integrals representing the shared data are independent of any quadratures, which is the reason for that the proposed method can ensure both the efficiency and accuracy.
It must be emphasized that the foundation of the proposed method is the structure property of the SWG functions. If other forms of basis functions such as the higher order basis functions are needed in some MoM models, additional approaches need to be explored.
A. Calculation Formulae
A.1. The Formula of When
A.2. The Formula of
A.3. The Formula of
A.4. The Formula of
A.5. The Formula of
This work was supported by the National Basic Research Program of China (nos. 2009CB320203 and 2010CB327400).
- W. C. Chew, J. M. Jin, E. Michielssen, and J. Song, Fast and Efficient Algorithms in Computational Electromagnetics, Artech House, London, 2001.
- R. F. Harrington, Field Computation by Moment Methods, The MacMillian, New York, NY, USA, 1968.
- S. M. Rao, D. R. Wilton, and A. W. Glisson, “Electro-magnetic scattering by surfaces of arbitrary shape,” IEEE Transactions on Antennas and Propagation, vol. 30, no. 3, pp. 409–418, 1982.
- D. H. Schaubert, D. R. Wilton, and A. W. Glisson, “A tetrahedral modeling method for electromagnetic scattering arbitrarily shaped inhomogeneous dielectric bodies,” IEEE Transactions on Antennas and Propagation, vol. 32, no. 1, pp. 77–85, 1984.
- Y. Zhang, Electromagnetic Field Parallel Computation, XDUP, Xi An, China, 2006, (Chinese).
- Y. Zhang, M. Taylor, T. K. Sarkar et al., “Parallel in-core and out-of-core solution of electrically large problems using the RWG basis functions,” IEEE Antennas and Propagation Magazine, vol. 50, no. 5, pp. 84–94, 2008.
- Y. Zhang and T. K. Sarkar, Parallel Solution of Integral Equation-Based EM Problems in the Frequency Domain, John Wiley & Sons, New York, NY, USA, 2009.
- J.-Y. Peng, H.-X. Zhou, K.-L. Zheng et al., “A shared memory-based parallel out-of-core LU solver for matrix equations with application in EM problems,” in Proceedings of the 1st International Conference on Computational Problem-Solving (ICCP '10), pp. 149–152, December 2010.
- J. Y. Peng, Research on Parallel Technology for Solving the MoM Model in Electromagnetic Field [M.S. dissertation], Southeast University, Jiangsu, China, 2011, (Chinese).
- M. J. Quinn, Parallel Programming in C with MPI and Open MP, McGraw-Hill, New York, NY, USA, 2004.
- R. F. Harrington, Time-Harmonic Electromagnetic Fields, McGraw-Hill, New York, NY, USA, 1961.
- L. Zhang, T. Cui, and H. Liu, “A set of symmetric quadrature rules on triangles and tetrahedra,” Journal of Computational Mathematics, vol. 27, no. 1, pp. 89–96, 2009.
- G. H. Golub and C. F. van Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, Md, USA, 3rd edition, 1996.