A Fourier Extension Based Numerical Integration Scheme for Fast and High-Order Approximation of Convolutions with Weakly Singular Kernels

DOI10.1137/18M1232826WikidataQ127318659 ScholiaQ127318659MaRDI QIDQ5194605

Publication date: 16 September 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.03835

zbMATH Keywords

convolution singular function scattering problem quadrature method high order Fourier extension

Mathematics Subject Classification ID

Convolution as an integral transform (44A35) Numerical methods for integral transforms (65R10) Algorithms for approximation of functions (65D15) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (1)

Two algorithms for periodic extension on uniform grids

Cites Work

On the numerical stability of Fourier extensions
A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
A fast, higher-order solver for scattering by penetrable bodies in three dimensions
An FC-based spectral solver for elastodynamic problems in general three-dimensional domains
End-point corrected trapezoidal quadrature rules for singular functions
A Nyström method for boundary integral equations in domains with corners
High-order quadratures for the solution of scattering problems in two dimensions
The Gibbs- Wilbraham phenomenon: An episode in Fourier analysis
On the Gibbs phenomenon. I: Recovering exponential accuracy from the Fourier partial sum of a nonperiodic analytic function
Exponentially accurate approximations to piece-wise smooth periodic functions
A new parallel solver for the nonperiodic incompressible Navier-Stokes equations with a Fourier method: Application to frontal polymerization
On a fast direct elliptic solver by a modified Fourier method
High-order corrected trapezoidal quadrature rules for functions with a logarithmic singularity in 2-D.
A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
Extrapolation algorithms for filtering series of functions, and treating the Gibbs phenomenon
Fast convolution with radial kernels at nonequispaced knots
Resolution properties of the Fourier method for discontinuous waves
On the Gibbs phenomenon. V: Recovering exponential accuracy from collocation point values of a piecewise analytic function
Rational trigonometric approximations using Fourier series partial sums
A spectral embedding method applied to the advection-diffusion equation
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
High-order corrected trapezoidal quadrature rules for the Coulomb potential in three dimensions
Fast Algorithms for the Computation of Fourier Extensions of Arbitrary Length
Corrected trapezoidal rules for a class of singular functions
On the Fourier Extension of Nonperiodic Functions
A Fast Algorithm for Fourier Continuation
Hybrid Gauss-Trapezoidal Quadrature Rules
On the Gibbs Phenomenon and Its Resolution
High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
On Some Applications of the Superposition Principle with Fourier Basis
Function Approximation on Arbitrary Domains Using Fourier Extension Frames
A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions
On the Gibbs Phenomenon IV: Recovering Exponential Accuracy in a Subinterval from a Gegenbauer Partial Sum of a Piecewise Analytic Function
On the Gibbs Phenomenon III: Recovering Exponential Accuracy in a Sub-Interval From a Spectral Partial Sum of a Pecewise Analytic Function
Higher-Order Fourier Approximation in Scattering by Two-Dimensional, Inhomogeneous Media
A Padé-based algorithm for overcoming the Gibbs phenomenon
Numerical quadratures for singular and hypersingular integrals

This page was built for publication: A Fourier Extension Based Numerical Integration Scheme for Fast and High-Order Approximation of Convolutions with Weakly Singular Kernels