首页> 外文期刊>Microwave and optical technology letters >Application of preconditioned Krylov subspace iterative FFT techniques to method of lines for analysis of the infinite plane metallic grating
【24h】

Application of preconditioned Krylov subspace iterative FFT techniques to method of lines for analysis of the infinite plane metallic grating

机译:预处理Krylov子空间迭代FFT技术在无限大平面金属光栅分析线法中的应用

获取原文
获取原文并翻译 | 示例
       

摘要

In this paper, both fast Fourier transformation (FFT) and preconditioned iterative solvers are introduced into method of lines (MOL) to further enhance the computational efficiency of this semi-analytic method. Electromagnetic wave scattering by an infinite plane metallic grating is used as the examples to describe its implementation. For arbitrary incident wave, Helmholz equation and boundary condition are first transformed into new ones so that the impedance matrix elements is calculated by FFT technique. As a result, this Topelitz impedance matrix only requires O(N) memory storage for the Krylov subspace iterative-FFT method to solve the current distribution involving the computational complexity O(N log N). The banded diagonal impedance matrix is selected as preconditioner to speed up the convergence rate of the Krylov subspace iterative algorithms. Our numerical results show that the preconditioned Krylov subspace iterative-FFT method converges to accurate solution in much smaller CPU time.
机译:本文将快速傅里叶变换(FFT)和预处理的迭代求解器引入线法(MOL),以进一步提高这种半解析方法的计算效率。以无限平面金属光栅对电磁波的散射为例来描述其实现。对于任意入射波,首先将Helmholz方程和边界条件转换为新的方程,然后通过FFT技术计算阻抗矩阵元素。结果,该Topelitz阻抗矩阵只需要O(N)存储器用于Krylov子空间迭代FFT方法即可解决涉及计算复杂度O(N log N)的电流分布。选择带状对角阻抗矩阵作为预处理器,以加快Krylov子空间迭代算法的收敛速度。我们的数值结果表明,预处理的Krylov子空间迭代FFT方法收敛到了更短的CPU时间内的精确解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号