矩量法中阻抗矩阵的稀疏化研究  

Sparsification of the Impedance Matrix in MoM

作　　者：任仪[1] 聂在平[1] 赵延文[1] 马文敏[1] 

机构地区：[1]电子科技大学电子工程学院,四川成都610054

出　　处：《电子学报》2007年第12期2354-2358,共5页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60571022;60431010);国家部级基金(No.9140A03010507D0209)

摘　　要：将高阶叠层矢量基函数及最大正交高阶矢量基函数应用于电磁场积分方程方法,提出将阻抗矩阵按稀疏阵处理的方法.通过文中的处理,使得存储阻抗矩阵的内存需求量和求解矩阵方程的迭代求解时间大为降低.本文还结合适当算例,分析了判断门限的选取对阻抗矩阵的存储量与迭代法求解的计算量的影响.A method to achieve the sparsification of the impedance matrix is proposed when the higher order hierarchical vector basis functions and the maximally orthogonalized higher order vector basis functions are applied to electromagnetic integral equations. Both the theory analysis and the numerical experiment demonstrate that this method will decrease the memory requirement for storing the impedance matrix and the CPU time consumed in solving the matrix equation when using an iterative method. Moreover, some numerical results have been given to study the different effects on the requirements for the memory and CPU time caused by different thresholds.

关 键 词：电磁场积分方程 高阶矢量基函数 最大正交化 稀疏矩阵 

分 类 号：TN[电子电信]