Toeplitz property on order indices of Laguerre expansion methods
Toeplitz property on order indices of Laguerre expansion methods
复制标题
DOI：
10.1109/mwsym.2009.5165681
复制
发表时间：
2009-06
期刊：
影响因子：
--
通讯作者：
A. Geranmayeh;W. Ackermann;T. Weiland
中科院分区：
文献类型：
--
作者：
A. Geranmayeh;W. Ackermann;T. Weiland
通过经典的有序推进方案无条件稳定求解时域积分方程需要 O(Nt3Ns2) 个 CPU 周期，其中 Nt 和 Ns 分别是时间和空间未知数的数量。提出了基于离散快速傅立叶变换 (FFT) 的算法来加速延迟交互矩阵的 Toeplitz 块聚合的递归时间卷积乘积，从而将总体计算成本和内存需求分别降低到 O(α(Ns)Ntlog(Nt)) 和 O(Ntα(Ns))。任意形状散射体的仿真结果证明了该技术的准确性和效率。
The unconditionally stable solution of time-domain integral equations by the classical marching-on-in-order schemes demands O(Nt3Ns2) CPU cycles, where Nt and Ns are the number of temporal and spatial unknowns, respectively. Discrete fast Fourier transform (FFT)-based algorithms are proffered to expedite the recursive temporal convolution products of the Toeplitz block aggregates of the retarded interaction matrices through which the overall computational cost and memory requirements reduces to O(α(Ns)Ntlog(Nt)) and O(Ntα(Ns)), respectively. Simulation results for arbitrarily shaped scatterers demonstrate the accuracy and efficiency of the technique.