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

AAA 算法的最初五年

The first five years of the AAA algorithm

Yuji Nakatsukasa, Olivier Sete, Lloyd N. Trefethen

AI总结:

本文回顾 AAA 算法提出五年来的优势、应用与扩展,指出其能快速稳健地计算有理逼近,并可能长期具有重要价值。

摘要:

AAA 算法于 2018 年提出,用于计算实数轴或复平面子集上函数或数据的最佳或近最佳有理逼近。它比以往解决此类问题的算法更快、更稳健,自问世以来已应用于许多场景,包括不规则区域中 Laplace、Poisson 和双调和 PDE 问题的数值求解。AAA 还被拓展到新的方向,并且似乎有望在未来成为一种具有持久重要性的工具。

英文摘要:

The AAA algorithm, introduced in 2018, computes best or near-best rational approximations to functions or data on subsets of the real line or the complex plane. It is much faster and more robust than previous algorithms for such problems and has been used in many applications since its appearance, including the numerical solution of Laplace, Poisson, and biharmonic PDE problems in irregular domains. AAA has also been extended in new directions and seems likely to be a tool of lasting importance in the future.

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

↑