摘要
针对矩量法求解电磁场体积分方程过程中需要四面体单元间的公共面和边界面信息,即解体积分方程前处理步骤,利用图论的概念,提出了一种O(N)的快速算法。数值计算显示,采用该快速算法,在普通微机上可以分钟量级时间完成千万数量级变量的前处理步骤。
A fast algorithm is proposed for finding the common-face of a pair of adjacent tetrahedrons and for finding the boundary face of a single tetrahedron in the pre-processing of the Method of Moments, with which the volume integral equation is solved. The fast algorithm is based on the concepts of incidence ma- trix in the graph theory. The computational complexity for finding the common-faces and boundary faces in the algorithm is 0 （N）, which is verified by numerical simulation. This algorithm can complete the pre- processing of a problem with ten million unknowns in several minutes on a personal computer.
出处
《南京邮电大学学报（自然科学版）》
北大核心
2012年第3期21-23,共3页
Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition
基金
国家自然科学基金(61071021)
国家科技重大专项(2010ZX3007-002)
毫米波国家重点实验室开放课题(K201222)
南京邮电大学科研基金(NY209006)资助项目
关键词
矩量法
体积分方程
基函数
前处理
快速算法
图论
method of moments
volume integral equation
basis function
pre-processing
fast algo-rithm
graph theory
