首页> 外文期刊>Applied Computational Electromagnetics Society journal >Preconditioned GIFFT: A Fast MoM Solver for Large Arrays of Printed Antennas
【24h】

Preconditioned GIFFT: A Fast MoM Solver for Large Arrays of Printed Antennas

机译:预处理的GIFFT:一种用于大型印刷天线阵列的快速MoM解决方案

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

摘要

A new type of fast method of moments (MoM) solution scheme using standard basis functions for large arrays with arbitrary contours and/or missing elements is applied to array antennas in a layered configuration. The efficiency of the method relies on use of the FFT along with approximating the Green's function as a separable sum of interpolation functions defined on a relatively sparse, uniform grid. The method is ideally suited for solving array problems, and its effectiveness is demonstrated here for planar arrays of printed antennas. Both fill and solve times, as well as memory requirements, are dramatically improved with respect to standard MoM solvers.
机译:针对具有任意轮廓和/或缺少元素的大型阵列,使用标准基函数的新型快速矩量法(MoM)解决方案,已应用于分层配置的阵列天线。该方法的效率依赖于FFT的使用以及将格林函数近似为在相对稀疏,均匀的网格上定义的插值函数的可分离总和。该方法非常适合解决阵列问题,并且在此证明了其对印刷天线的平面阵列的有效性。与标准MoM求解器相比,填充和求解时间以及内存需求都得到了显着改善。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号