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

基于边界区间数据的傅里叶扩展快速算法

Fast Algorithms for Fourier extension based on boundary interval data

Z. Y. Zhao, Y. F Wang, A. G. Yagola

AI总结:

本文针对非周期函数逼近问题,提出边界优化快速傅里叶扩展算法及边界振荡函数改进变体,通过参数优化与边界网格细化提升效率与精度,数值实验验证其性能并给出参数选择指南。

摘要:

本文提出一种新型边界优化快速傅里叶扩展算法,用于高效逼近非周期函数。该方法通过策略性利用边界区间数据构建周期扩展,随后将其与原函数样本结合形成扩展周期表示。我们开发了参数优化框架,在仅需部署少量边界节点的情况下保持超代数收敛,计算复杂度略高于标准FFT实现。此外,我们提出针对边界振荡函数的改进算法变体,该变体在边界附近采用网格细化,将分辨率常数降至传统方法的约四分之一。综合数值实验验证了所提方法的效率和准确性,并确立了参数选择的实用指南。

英文摘要:

This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary interval data, which is subsequently combined with original function samples to form an extended periodic representation. We develop a parameter optimization framework that preserves superalgebraic convergence while requiring only a few boundary node deployment, resulting in computational complexity marginally exceeding that of standard FFT implementations. Furthermore, we present an improved version of the algorithm tailored for functions exhibiting boundary oscillations. This variant employs grid refinement near the boundaries, which reduces the resolution constant to approximately one-fourth of that in conventional approaches. Comprehensive numerical experiments confirm the efficiency and accuracy of the proposed methods and establish practical guidelines for parameter selection.

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

↑