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

关于傅里叶延拓的数值稳定性

On the numerical stability of Fourier extensions

Purdue University(普渡大学);Katholieke Universiteit Leuven(荷语鲁汶大学);University of Salamanca(萨拉曼卡大学)

Ben Adcock, Daan Huybrechs, Jesus Martin-Vaquero

AI总结:

本文证明傅里叶延拓在有限精度计算中数值稳定,且收敛速度至少是超代数的,并进一步说明其在等距数据逼近中能稳定地达到超代数收敛。

摘要:

在有界区间上逼近解析非周期函数的一种有效方法是在更大区域上使用傅里叶级数。当适当构造时,这种所谓的傅里叶延拓在截断参数上已知具有几何快速收敛性。不幸的是,计算傅里叶延拓需要求解一个病态线性系统,因此人们可能预期在有限精度计算中这种快速收敛会被破坏。本文的目的在于表明情况并非如此。具体地,我们证明傅里叶延拓在有限算术实现中实际上是数值稳定的,并且达到至少超代数的收敛速度。因此,在这个实例中,线性系统的病态性并不妨碍获得良好的逼近。在本文的第二部分,我们考虑从等距数据计算傅里叶延拓的问题。Platte、Trefethen 和 Kuijlaars 的一个结果指出,对于这个问题,没有任何方法能够同时实现数值稳定和指数收敛。我们解释了傅里叶延拓如何与这一理论障碍相关联,并证明它们特别适合这个问题:即,它们以数值稳定的方式获得至少超代数的收敛。

英文摘要:

An effective means to approximate an analytic, nonperiodic function on a bounded interval is by using a Fourier series on a larger domain. When constructed appropriately, this so-called Fourier extension is known to converge geometrically fast in the truncation parameter. Unfortunately, computing a Fourier extension requires solving an ill-conditioned linear system, and hence one might expect such rapid convergence to be destroyed when carrying out computations in finite precision. The purpose of this paper is to show that this is not the case. Specifically, we show that Fourier extensions are actually numerically stable when implemented in finite arithmetic, and achieve a convergence rate that is at least superalgebraic. Thus, in this instance, ill-conditioning of the linear system does not prohibit a good approximation. In the second part of this paper we consider the issue of computing Fourier extensions from equispaced data. A result of Platte, Trefethen & Kuijlaars states that no method for this problem can be both numerically stable and exponentially convergent. We explain how Fourier extensions relate to this theoretical barrier, and demonstrate that they are particularly well suited for this problem: namely, they obtain at least superalgebraic convergence in a numerically stable manner.

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

↑