Journal of Computational and Applied Mathematics - Orthogonal polynomials and numerical methods
Rational trigonometric approximations using Fourier series partial sums
Journal of Scientific Computing
A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
Journal of Computational Physics
Fast monte-carlo algorithms for finding low-rank approximations
Journal of the ACM (JACM)
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
SIAM Journal on Computing
SIAM Journal on Computing
Journal of Computational Physics
On the Fourier Extension of Nonperiodic Functions
SIAM Journal on Numerical Analysis
Journal of Computational Physics
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
A Fast Algorithm for Fourier Continuation
SIAM Journal on Scientific Computing
On the resolution power of Fourier extensions for oscillatory functions
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
We present an analysis of the convergence of recently developed Fourier continuation techniques that incorporates the required truncation of the Singular Value Decomposition (SVD). Through the analysis, the convergence of SVD-based continuations are related to the convergence of any Fourier approximation of similar form, demonstrating the efficiency and accuracy of the numerical method. The analysis determines that the Fourier continuation approximation error can be bounded by a key value that depends only on the parameters of the Fourier continuation and on the points over which it is applied. For any given distribution of points, a finite number of calculations can be performed to obtain this important value. Our numerical computations on evenly spaced points show that as the number of points increases, this quantity converges to a fixed value, allowing for broad conclusions on the convergence of Fourier continuations calculated with truncated SVDs. We conclude that Fourier continuations can obtain super-algebraic or even exponential convergence on evenly spaced points for non-periodic functions until the convergence is limited by a parameter normally chosen near the machine precision accuracy threshold.