矩量法讲义_Method_of_Moments_and_Fast_Algorithms.pptVIP

矩量法讲义_Method_of_Moments_and_Fast_Algorithms.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
矩量法讲义_Method_of_Moments_and_Fast_Algorithms

Method of Moments and Fast Algorithms 1. Wire Antennas Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) Wire Antennas (cont’d) 2. Wire Circuits 3. Wire Circuits with Arbitrary Cross Sections The fast extended Born approximation (EBorn) gives exactly the same results as the direct EBorn. However, it reduces the complexity from 9N 2 to 12 N log N . Hence, it is very fast. The fast EBorn is much more accurate than the Born approximation (BA), especially for low frequencies. When the contrast of the target is not very large, the EBorn gives accurate results. However, BA is only valid for weak targets. In the conventional CG-FFT algorithm, the first step is in fact the Born approximation. Hence, it is the BA-based CG-FFT. For low-frequency problems, like the detection using the VETEM system, if we use EBorn as the initial guess, the CG-FFT algorithm will converge very fast. We call this the EBorn-based CG-FFT. Also, the EBorn operator can be used as the preconditioner of the CG-FFT algorithm, making the convergence faster. For a given problem and a given accuracy, the beamwidth at all levels can be precomputed before doing the fast-multipole computations; The RPFMA is error controllable; The effective beamwith becomes smaller when the group distance is larger. Set up an Oct-tree structure for 3D problems For conventional MLFMA, the coarsest level is chosen as Lc = 2 for the best efficiency For MLFMA-RPFMA, the coarsest level is chosen as Lc = 2 or higher For MLFMA-FAFFA or MLFMA-RPFMA-FAFFA, the coarsest level must be Lc = 3 or higher to use the far-field approximation. In this case, the optimal coarsest level is to make the number of unknowns in each group is approximately the square root of the number of the total unknowns. For a given threshold ε, we can classify al

文档评论(0)

feixiang2017 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档