• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Microwave and Guided Wave Letters >Fast algorithm for scattering from planar arrays of conducting patches
【24h】

Fast algorithm for scattering from planar arrays of conducting patches

机译：从导电贴片的平面阵列散射的快速算法

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A direct (noniterative) algorithm for the solution of the electromagnetic scattering from three-dimensional planar arrays of conducting patches is developed. For an N-unknown problem, the computational complexity of this new solution technique is shown to be O(N/sup 2/log/sup 2/N), which is considerably lower than the O(N/sup 3/) computational complexity of the conventional direct solution techniques. The advantages of the reduction in the computational complexity is pronounced in the solution of large electromagnetics problems, such as scattering from large and finite arrays of patches, synthesis and analysis of finite-sized frequency selective surfaces (FSSs), and radiation and scattering from large phased-array antennas, to name a few.
机译：开发了一种直接（非迭代）算法，用于求解导电贴片的三维平面阵列中的电磁散射。对于N个未知问题，此新解决方案技术的计算复杂度显示为O（N / sup 2 / log / sup 2 / N），大大低于O（N / sup 3 /）的计算复杂度常规直接解决方案技术。降低计算复杂性的优势在解决大型电磁问题中非常显着，例如从大型有限阵列的散射，有限尺寸频率选择表面（FSS）的合成和分析以及大型电磁的辐射和散射相控阵天线，仅举几例。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号