P-FFT and FG-FFT with real coefficients algorithm for the EFIE  

针对电场积分方程的P-FFT和FG-FFT实系数算法(英文)

作　　者：谢家烨[1] 周后型[1] 牟星[1] 华光[1] 李卫东[1] 洪伟[1] 

机构地区：[1]东南大学毫米波国家重点实验室,南京210096

出　　处：《Journal of Southeast University(English Edition)》2014年第3期267-270,共4页东南大学学报（英文版）

基　　金：The National Basic Research Program of China(973Program)(No.2013CB329002)

摘　　要：In order to reduce the storage amount for the sparse coefficient matrix in pre-corrected fast Fourier transform （P-FFT） or fitting the Green function fast Fourier transform （FG-FFT）, the real coefficients are solved by improving the solution method of the coefficient equations. The novel method in both P-FFT and FG-FFT for the electric field integral equation （EFIE） is employed. With the proposed method, the storage amount for the sparse coefficient matrix can be reduced to the same level as that in the adaptive integral method （AIM） or the integral equation fast Fourier transform （IE-FFT）. Meanwhile, the new algorithms do not increase the number of the FFTs used in a matrix-vector product, and maintain almost the same level of accuracy as the original versions. Besides, in respect of the time cost in each iteration, the new algorithms have also the same level as AIM （or IE- FFF）. The numerical examples demonstrate the advantages of the proposed method.为了减少预修正快速傅立叶变换算法(P-FFT)或拟合格林函数快速傅立叶变换算法(FG-FFT)的稀疏系数矩阵所需的存储空间,通过改进系数方程的求解方法,获得实系数解.并将改进的求解方法与P-FFT和FG-FF相结合用于计算电场积分方程.所提方案将P-FFT/FG-FFT的稀疏系数矩阵的存储量降到自适应积分方法(AIM)/积分方程快速傅立叶变换算法(IE-FFT)相同水平的同时,未增加矩阵向量积所需FFT的次数,并保持原有算法的精度水平.此外,在每次迭代的时间耗费方面,新方案与AIM/IE-FFT相当.数值实验证实了新方案的上述优点.

关 键 词：real coefficients complex coefficients pre-corrected fast Fourier transform （P-FFT） fitting the Greenfunction fast Fourier transform （FG-FFT） 

分 类 号：TN011[电子电信—物理电子学]