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

快速评估实数和复数指数和

Fast evaluation of real and complex exponential sums

University Osnabrück, Institute of Mathematics(奥斯纳布吕克大学数学研究所)

Stefan Kunis, Ines Melzer

AI总结:

本文提出一种快速傅里叶-拉普拉斯变换方法,结合蝴蝶逼近和分层逼近,实现复平面上节点处多项式快速评估。

摘要:

最近,蝴蝶逼近方案和分层逼近已被提出,用于高效计算具有振荡性和渐近光滑核的积分变换。结合这两种方法,我们提出了一种特定的快速傅里叶-拉普拉斯变换,特别允许快速评估复平面上节点处的多项式。所有理论结果均通过数值实验进行说明。

英文摘要:

Recently, the butterfly approximation scheme and hierarchical approximations have been proposed for the efficient computation of integral transforms with oscillatory and with asymptotically smooth kernels. Combining both approaches, we propose a certain fast Fourier-Laplace transform, which in particular allows for the fast evaluation of polynomials at nodes in the complex unit disk. All theoretical results are illustrated by numerical experiments.

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

↑