arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1107.0498math.NAcs.NAmath.CV
收藏

高阶导数的最优围道

Optimal Contours for High-Order Derivatives

Technische Universität München(慕尼黑工业大学)

Folkmar Bornemann, Georg Wechslberger

AI总结:

本文针对柯西积分公式计算全纯函数高阶导数的问题,通过Provan算法在加权平面图中寻找最短包围行走,最小化网格路径的条件数,得到最优矩形路径,有效处理了分支割奇异点等圆形围道效果不佳的情形。

摘要:

作为更一般围道积分问题的模型,我们考虑使用柯西积分公式数值计算全纯函数的高阶导数。Bornemann (2011) 表明柯西积分的条件数强烈依赖于所选围道,并解决了圆形围道条件数最小化的问题。本文在步长为h的网格路径类中,使用Provan算法在嵌入平面的加权图中寻找最短包围行走,从而最小化条件数。数值例子表明,即使在已知圆形围道效果有限的情况下,例如具有分支割奇异点的函数,最优矩形路径也能产生较小的条件数。

英文摘要:

As a model of more general contour integration problems we consider the numerical calculation of high-order derivatives of holomorphic functions using Cauchy's integral formula. Bornemann (2011) showed that the condition number of the Cauchy integral strongly depends on the chosen contour and solved the problem of minimizing the condition number for circular contours. In this paper we minimize the condition number within the class of grid paths of step size h using Provan's algorithm for finding a shortest enclosing walk in weighted graphs embedded in the plane. Numerical examples show that optimal rectangular paths yield small condition numbers even in those cases where circular contours are known to be of limited use, such as for functions with branch-cut singularities.

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

↑