P. L. Rui
Nanjing University of Science and Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by P. L. Rui.
IEEE Transactions on Antennas and Propagation | 2008
Dazhi Z. Ding; Rushan Chen; Zhenhong Fan; P. L. Rui
A new set of higher order hierarchical basis functions based on curvilinear triangular patch is proposed for expansion of the current in electrical field integral equations solved by method of moments. The hierarchical two-level spectral preconditioning technique is developed for the generalized minimal residual iterative method, in which the multilevel fast multipole method is used to accelerate matrix-vector product. The sparse approximate inverse (SAI) preconditioner based on the higher order hierarchical basis functions is used to damp the high frequencies of the error and the low frequencies is eliminated by a spectral preconditioner in a two-level manner defined on the lower order basis functions. The spectral preconditioner is combined with SAI preconditioner to obtain a hierarchical two-level spectral preconditioner. Numerical experiments indicate that the new preconditioner can significantly reduce both the iteration number and computational time.
IEEE Transactions on Antennas and Propagation | 2005
P. L. Rui; R. S. Chen; Zhenhong Fan; Edward K. N. Yung; Cheong-Fat Chan; Zaiping Nie; Jun Hu
The problem of electromagnetic scattering by three-dimensional dielectric bodies is formulated in terms of a weak formulation of the domain-integral equation. Applying Galerkins method with rooftop functions as basis and testing functions, the integral equation can be solved by the Krylov-subspace iterative fast Fourier transform (FFT) methods. However, poor convergence is observed when the relative permittivity of the scatterer becomes large. In order to relieve this trouble, an augmented generalized minimum residual method (AGMRES) is presented. Comparisons between several typical iterative methods are made to show the efficiency of our proposed method.
IEEE Transactions on Antennas and Propagation | 2007
P. L. Rui; Rushan Chen; D. X. Wang; Edward K. N. Yung
A new spectral two-step preconditioning of multilevel fast multipole algorithm (MLFMA) is proposed to solve large dense linear systems with multiple right-hand sides arising in monostatic radar cross section (RCS) calculations. The first system is solved with a deflated generalized minimal residual (GMRES) method and the eigenvector information is generated at the same time. Based on this eigenvector information, a spectral preconditioner is defined and combined with a previously constructed sparse approximate inverse (SAI) preconditioner in a two-step manner, resulting in the proposed spectral two-step preconditioner. Restarted GMRES with the newly constructed spectral two-step preconditioner is considered as the iterative method for solving subsequent systems and the MLFMA is used to speed up the matrix-vector product operations. Numerical experiments indicate that the new preconditioner is very effective with the MLFMA and can reduce both the iteration number and the computational time significantly.
IEEE Transactions on Antennas and Propagation | 2007
P. L. Rui; Rushan Chen; D. X. Wang; E. Kai-Ning Yung
A new spectral multigrid method (SMG) combined with the multilevel fast multipole method (MLFMM) is proposed for solving electromagnetic wave scattering problems. The MLFMM is used to speed up the matrix-vector product operations and the SMG is employed to accelerate the convergence rate of the Krylov iteration. Unlike traditional algebraic multigrid methods (AMG), the spectral multigrid method is an algebraic two-grid cycle built on a preconditioned Krylov iterative method that is used as the smoother, and the grid transfer operators are defined using the spectral information of the preconditioned matrix. Numerical experiments indicate that this class of multigrid method is very effective with the MLFMM and can reduce both the iteration number and the overall simulation time significantly.
ieee antennas and propagation society international symposium | 2006
P. L. Rui; S.S. Li; R. S. Chen
In this paper, an efficient variant of the generalized minimal residual method, which is the GMRESR iterative method has been proposed and demonstrated to solve the large, sparse matrix equation obtained from an ungauged formulation of FEM analysis Helmholtz Equations. The performance of variable preconditioning for GMRESR method is further improved by using an efficient symmetric successive over-relaxation (SSOR) preconditioning for the inner GMRES method. Several electromagnetic structures are analyzed and good convergence improvement is achieved in terms of both the iteration number and CPU time
ieee antennas and propagation society international symposium | 2006
P. L. Rui; S.S. Li; R. S. Chen
A weak-form GMRESIR-FFT method is developed for iterative solution of 3D volume electric field integral equation. Approximate eigenvectors are employed by using implicit restarting scheme to alleviate the ill effect of restarting in GMRES iteration process, and hence improves convergence. Numerical experiments are conducted, which show that GMRESIR-FFT is more efficient and robust than the conventional CG-FFT and BCG-FFT methods
ieee antennas and propagation society international symposium | 2006
Z. H. Fan; Edward K. N. Yung; P. L. Rui; R. S. Chen
This paper aims to develop a fast and robust algorithm for three-dimensional problems, especially for large-permittivity case. We adopt the generalized minimum residual (GMRES) and loose GMRES to replace the CG or BCG method to solve the integral equation, and investigate their efficiency in the application. We show that all methods produce accurate results and when the contrast is high, the loose GMRES has a superior behavior among the different iterative methods
ieee antennas and propagation society international symposium | 2006
S.S. Li; P. L. Rui; R. S. Chen
In this paper, we consider a new approach to choose the priori sparsity pattern, and present a pre- and post-filtration technique for sparse approximate inverse (SAI) implementation to alleviate this difficulty. Experiment shows that these tricks are very effective when combined with conjugate gradient (CG) method to solve 3D electromagnetic field (EM) problems
ieee antennas and propagation society international symposium | 2006
P. L. Rui; S.S. Li; R. S. Chen
In this paper, the deflated restarting GMRES (DRGMRES) iterative method, combined with the nonuniform FFT (NUFFT) algorithms, is first proposed to solve 3D weak-form volume electric field integral equations in electromagnetic scattering problems. Numerical experiments for problems with both large and small regions are conducted, which shows the advantage of the NUFFT over the conventional FFT methods and the efficiency of DRGMRES for improving convergence of the standard GMRES
ieee antennas and propagation society international symposium | 2005
L. Mo; P. L. Rui; W. Zhuang; R. S. Chen; D. X. Wang
The large-scale microstrip antenna array is analyzed by use of the adaptive integral method (AIM). The resulting integral equations are then solved by the loose generalized minimal residual (LGMRES) method to accelerate iteration. One typical microstrip antenna array is analyzed and the good results demonstrate the validity of the proposed algorithm. Our numerical calculations show that the LGMRES can converge about 6 times faster than the conjugate gradient (CG) method.