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

用于有理逼近的AAA算法

The AAA algorithm for rational approximation

University of Oxford(牛津大学);TU Berlin(柏林工业大学)

Yuji Nakatsukasa, Olivier Sète, Lloyd N. Trefethen

AI总结:

本文提出了一种新的有理函数逼近算法,能够在实数或复数点集上实现,仅需40行Matlab代码且无需用户输入参数。该算法在盘状或区间上可能优于现有方法,在更复杂的域上尤为竞争性强。核心思想是(1)用重心形式表示有理近似函数并在特定支撑点进行插值,(2)通过贪心选择支撑点以避免指数级不稳定性。AAA名称致敬了提出基于(1)方案的Antoulas和Anderson。本文提供了核心算法的Matlab代码和九个应用,并描述了针对不同类型问题的变种。与向量拟合、RKFIT和其他现有有理逼近方法进行了比较。

摘要:

我们介绍了一种新的有理函数逼近算法,该算法可在实数或复数点集上实现,用40行Matlab代码即可实现,且不需要用户输入参数。即使在盘状或区间上,该算法也可能优于现有方法,而在更复杂的域上尤其具有竞争力。核心思想是(1)用重心形式表示有理近似函数并在特定支撑点进行插值,(2)通过贪心选择支撑点以避免指数级不稳定性。AAA名称致敬了提出基于(1)方案的Antoulas和Anderson。我们提供了核心算法的Matlab代码和九个应用,并描述了针对不同类型问题的变种。与向量拟合、RKFIT和其他现有有理逼近方法进行了比较。

英文摘要:

We introduce a new algorithm for approximation by rational functions on a real or complex set of points, implementable in 40 lines of Matlab and requiring no user input parameters. Even on a disk or interval the algorithm may outperform existing methods, and on more complicated domains it is especially competitive. The core ideas are (1) representation of the rational approximant in barycentric form with interpolation at certain support points and (2) greedy selection of the support points to avoid exponential instabilities. The name AAA stands for "adaptive Antoulas--Anderson" in honor of the authors who introduced a scheme based on (1). We present the core algorithm with a Matlab code and nine applications and describe variants targeted at problems of different kinds. Comparisons are made with vector fitting, RKFIT, and other existing methods for rational approximation.

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

↑