Two algorithms for periodic extension on uniform grids

DOI10.1007/s11075-020-00897-7zbMath1458.65161OpenAlexW3009094226MaRDI QIDQ2220736

Yanyan Li

Publication date: 25 January 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-020-00897-7

zbMATH Keywords

discrete Fourier transformfast decaying coefficient propertiesperiodic extension problem

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Fourier series and coefficients in several variables (42B05)

Cites Work

• Unnamed Item
• On the numerical stability of Fourier extensions
• High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
• A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
• Spectral methods for the computation of discontinuous solutions
• High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
• Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
• On the Fourier Extension of Nonperiodic Functions
• On the Gibbs Phenomenon and Its Resolution
• A Fourier Extension Based Numerical Integration Scheme for Fast and High-Order Approximation of Convolutions with Weakly Singular Kernels
• Filters, mollifiers and the computation of the Gibbs phenomenon
• Iterative Refinement in Floating Point

This page was built for publication: Two algorithms for periodic extension on uniform grids