Some new strategies for RCM ordering in solving electromagnetic scattering problems
Introduction
We are concerned with solving large linear systems that arise from edge element-based finite element discretization of high-frequency electromagnetic field simulations. The coefficient matrix of the linear equations which stem from the finite-element analysis of high-frequency electromagnetic field simulations such as scattering [1], [2], [3], [4], [5], [6], [7], [8], [9] is generally symmetric and indefinite. At present, the incomplete Cholesky factorization [10], [11], [12], [13], [14], [15], [16], [17] (IC) preconditioners applied with the preconditioned Conjugate Gradient (PCG) method are rather popular. Here RCM ordering methods preceding the incomplete Cholesky factorization are studied in the case of finite element (FEM) matrices arising from the discretization of the following electromagnetic scattering problem: with some absorbing boundary conditions, where is the scattering field, is the incident field, and and are relative permeability and permittivity, respectively.
The solution of Eq. (1) will result in a linear system where is sparse complex symmetric (usually indefinite), .
In the literature, the preconditioned conjugate gradient (PCG) method has been proven to be a competitive iterative method for the solution of symmetric linear systems arising from PDEs in many applications [15]. In order to perform a successful application of the PCG method, an effective preconditioner, such as the incomplete Cholesky factorization preconditioner, is needed first. It was illustrated in many studies that reordering of matrices plays a crucial effect in constructing a preconditioner with high quality.
In [18], Notay investigated the reverse Cuthill–McKee ordering and fill-in strategies for approximate factorization preconditioning. In [15], Clift and Tang described a kind of basis of a matrix ordering heuristic for improving the incomplete factorization used in preconditioned conjugate gradient techniques applied to anisotropic PDEs. And they presented a variation of RCM which is shown to generally improve the quality of incomplete factorization preconditioners. For convenience, we will use a general framework of RCM ordering, provided by Notay, which is close to the implementation form.
In order to test different strategies for RCM presented in this paper, we use a modified incomplete Cholesky factorization algorithm [14] which allows us to decide the sparsity of incomplete factorization preconditioners by two fill-in control parameters: (1) , the number of the largest number of nonzero entries in each row; and (2) dropping tolerance.
The rest of the paper is organized as follows. Some new strategies used in RCM ordering are presented in Section 2. In Section 3, numerical experiments are carried out to illustrate the efficiency of these strategies. Finally, concluding remarks are given in Section 4.
Section snippets
Application strategies for RCM
Reverse Cuthill–McKee ordering is normally used as a generally effective matrix coefficient insensitive ordering which is quick to compute [15], [17].
In the literature, the RCM ordering algorithm has been developed with a focus on how to select a starting node in the Cuthill–McKee ordering [18], i.e. the last node in the Reverse Cuthill–McKee ordering. In this paper, we will focus on selecting the first node of the RCM ordering method and the last node of the RCM ordering method.
In [18], Y.
Numerical tests
In order to evaluate the performance of our reordering strategies, we examined matrices arising from electromagnetic scattering problems. We implemented numerical experiments based on ITSOL packages [20]. All numerical tests were performed on the Linux operating system. All codes are programmed in C language and run on a PC, with 2 GB memory and a 2.66 GHz Intel(R) Core(TM)2 Duo CPU. The maximal iteration number is taken as 1000. The stopping criteria is . In all tests, the
Conclusions
We have presented and tested RCM ordering techniques with new strategies which consider the coefficients of matrices from electromagnetic problems by using a measure (see Eq. (3)) as that in [19]. These strategies associated with RCM ordering methods, based on Algorithm 2, result in an improved incomplete Cholesky factorization for PCG methods.
Numerical results indicate that the modified RCM technique with two strategies is generally better than normal RCM especially for difficult problems. We
Acknowledgments
We would like to thank the anonymous referees for their detailed comments which greatly improved this paper. We also thank Dr. Liang Li for his help in providing test problems. This research was supported by the NSFC (60973015, and 61170311), the Chinese Universities Specialized Research Fund for the Doctoral Program (20110185110020), the Youth Sci. and Tech. Fund of UESTC and the Fundamental Research Funds for the Central Universities.
References (20)
Preconditioning techniques for large linear systems: a survey
J. Comput. Phys.
(2002)The Finite Element Method in Electromagnetics
(1993)- et al.
Finite Element Method for Electromagnetics: Antennas, Microwave Circuits and Scattering Applications
(1998) - et al.
Electromagnetic scattering of two or more incident plane waves by a perfect, electromagnetic conductor cylinder coated with a metamaterial
Prog. Electromagnetics Res. B
(2008) - et al.
The efficient analysis of electromagnetic scattering from composite structures using hybrid cfie-iefie
Prog. Electromagnetics Res. B
(2008) - et al.
Rigorous auxiliary variable-based implementation of a second-order ABC for the vector FEM
IEEE Trans. Antennas and Propagation
(2006) Field Computation by Moment Method
(1993)- et al.
Scattering analysis of open-ended cavity with inner object
J. Electromagn. Waves Appl.
(2007) Scattering of electromagnetic radiation by a perfect electromagnetic conductor sphere
J. Electromagn. Waves Appl.
(2006)Scattering of electromagnetic waves from, vibrating perfect surfaces: Simulation using relativistic boundary conditions
J. Electromagn. Waves Appl.
(2006)
Cited by (3)
An ant colony hyperheuristic approach for matrix bandwidth reduction
2020, Applied Soft Computing JournalLow-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy
2021, RAIRO - Operations ResearchExperiments with pseudoperipheral vertex finders for heuristics for bandwidth reduction evolved by an ant colony hyperheuristic approach
2020, Proceedings - International Conference of the Chilean Computer Science Society, SCCC