Parameter selection and numerical approximation properties of Fourier extensions from fixed data

被引:10
作者
Adcock, Ben [1 ]
Ruan, Joseph [1 ]
机构
[1] Purdue Univ, Dept Math, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
Fourier extensions; Equispaced data; Stability; Resolution power; STABILITY;
D O I
10.1016/j.jcp.2014.05.036
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Fourier extensions have been shown to be an effective means for the approximation of smooth, nonperiodic functions on bounded intervals given their values on an equispaced, or in general, scattered grid. Related to this method are two parameters. These are the extension parameter T (the ratio of the size of the extended domain to the physical domain) and the oversampling ratio eta (the number of sampling nodes per Fourier mode). The purpose of this paper is to investigate how the choice of these parameters affects the accuracy and stability of the approximation. Our main contribution is to document the following interesting phenomenon: namely, if the desired condition number of the algorithm is fixed in advance, then the particular choice of such parameters makes little difference to the algorithm's accuracy. As a result, one is free to choose T without concern that it is suboptimal. In particular, one may use the value T = 2 - which corresponds to the case where the extended domain is precisely twice the size of the physical domain - for which there is known to be a fast algorithm for computing the approximation. In addition, we determine the resolution power (points-per-wavelength) of the approximation to be equal to T eta, and address the trade-off between resolution power and stability. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:453 / 471
页数:19
相关论文
共 17 条
[1]   On the Numerical Stability of Fourier Extensions [J].
Adcock, Ben ;
Huybrechs, Daan ;
Martin-Vaquero, Jesus .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2014, 14 (04) :635-687
[2]   A STABILITY BARRIER FOR RECONSTRUCTIONS FROM FOURIER SAMPLES [J].
Adcock, Ben ;
Hansen, Anders C. ;
Shadrin, Alexei .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2014, 52 (01) :125-139
[3]   On the resolution power of Fourier extensions for oscillatory functions [J].
Adcock, Ben ;
Huybrechs, Daan .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2014, 260 :312-336
[4]   BEYOND CONSISTENT RECONSTRUCTIONS: OPTIMALITY AND SHARP BOUNDS FOR GENERALIZED SAMPLING, AND APPLICATION TO THE UNIFORM RESAMPLING PROBLEM [J].
Adcock, Ben ;
Hansen, Anders C. ;
Poon, Clarice .
SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2013, 45 (05) :3132-3167
[5]  
[Anonymous], 1997, NUMERICAL LINEAR ALG
[6]  
Boyd JP, 2009, COMMUN COMPUT PHYS, V5, P484
[7]   A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds [J].
Boyd, JP .
JOURNAL OF COMPUTATIONAL PHYSICS, 2002, 178 (01) :118-160
[8]   Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis [J].
Bruno, Oscar P. ;
Han, Youngae ;
Pohlman, Matthew M. .
JOURNAL OF COMPUTATIONAL PHYSICS, 2007, 227 (02) :1094-1125
[9]  
Gottlieb D., 1977, Numerical Analysis of Spectral Methods: Theory and Applications, DOI DOI 10.1137/1.9781611970425
[10]   ON THE FOURIER EXTENSION OF NONPERIODIC FUNCTIONS [J].
Huybrechs, Daan .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 2010, 47 (06) :4326-4355