arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.06522math.NAcs.NA
收藏

基于相位分析的全局复根和极点寻找算法用于传播与辐射问题

Global Complex Roots and Poles Finding Algorithm Based on Phase Analysis for Propagation and Radiation Problems

Gdansk University of Technology(格但斯克理工大学)

Piotr Kowalczyk

AI总结:

本文提出了一种灵活有效的复根和极点寻找算法,通过分析解析函数的相位,能够在任意形状的搜索区域内识别候选区域,并利用离散化的柯西论证原理验证根/极点,通过自适应网格提高精度,通过不同结构的数值测试验证了方法的有效性及计算效率。

摘要:

本文提出了一种灵活且有效的复根和极点寻找算法。广泛类别的解析函数可以被分析,且可以考虑任意形状的搜索区域。该方法非常简单直观。它基于在正则网格的节点上采样函数,并分析函数的相位。结果产生一组候选区域,然后利用离散化的柯西论证原理验证根/极点。通过应用自适应网格可以提高结果的准确性。所提出技术的有效性通过涉及不同类型结构的数值测试得到支持,其中电磁波被引导和辐射。结果得到了验证,并检验了该方法的计算效率。

英文摘要:

A flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase. As a result, a set of candidate regions is created and then the roots/poles are verified using a discretized Cauchy's argument principle. The accuracy of the results can be improved by the application of a self-adaptive mesh. The effectiveness of the presented technique is supported by numerical tests involving different types of structures, where electromagnetic waves are guided and radiated. The results are verified, and the computational efficiency of the method is examined.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑