Preconditioned Sparse-Matrix/Canonical Grid Algorithm for Fast Analysis of Microstrip Structure
In this paper,the sparse-matrix/canonical grid (SMCG) is used to analyze large-scale planar structures.Discretization of the corresponding integral equations by method of moment (MoM) with Rao-Wilton-Glisson (RWG) basis functions can model arbitrarily shaped planar structures,but usually leads to a fully populated matrix. The integral equation is solved by the sparse-matrix/canonical grid (SMCG) with fast Fourier transforms technique (FFT) to accelerate the matrixvector multiplication. It reduces the memory requirement from O(N(2)) to O(N) and the operation complexity from O(N2) to O(NlogN),where N is the number of unknowns. The resultant equations are then solved by the generalized minimal residual method (GMRES) with several preconditioning techniques employed to enhance its computational efficiency. Microstrip antenna arrays are analyzed and the numerical results show that the preconditioned GMRES can converge much faster than conventional GMRES.
W.Zhuang H.L.Jia G.Wang R.S.Chen
Department of Communication Engineering Nanjing University of Science & Technology,Nanjing,210094,China
国际会议
2008 International Conference on Microwave and Millimeter Wave Technology(2008国际微波毫米波技术会议)
南京
英文
1301-1303
2008-04-21（万方平台首次上网日期，不代表论文的发表时间）