加载中…
Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest in computational rational approximation. The package supplies the fastest known implementations of these methods and the only arbitrary-precision ones. Combined with the package, it can produce compact and accurate representations of a huge variety of functions over intervals, circles, or other domains in the complex plane.

生成讲解博客的中文版本

生成AI智能校验的中文版本