Clenshaw-Curtis algorithms for an efficient numerical approximation of singular and highly oscillatory Fourier transform integrals

DOI10.1016/j.cam.2020.113201zbMath1462.65030OpenAlexW3087170700WikidataQ114202038 ScholiaQ114202038MaRDI QIDQ2222146

I. Kayijuka, Ali Konuralp, Serife Muge Ege, F. Serap Topal

Publication date: 3 February 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2020.113201

zbMATH Keywords

recurrence relationsspecial functionsChebyshev serieshighly oscillatory integralsClenshaw-Curtis methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)

Related Items (4)

Application of the Cauchy integral approach to singular and highly oscillatory integrals ⋮ Effective collocation methods to solve Volterra integral equations with weakly singular highly oscillatory Fourier or Airy kernels ⋮ Quadrature formulae of many highly oscillatory Fourier-type integrals with algebraic or logarithmic singularities and their error analysis ⋮ Unnamed Item

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating functions for the generalized Gauss hypergeometric functions
• Filon-Clenshaw-Curtis rules for a class of highly-oscillatory integrals with logarithmic singularities
• A method for numerical integration on an automatic computer
• Advances in mathematical inequalities and applications
• Analytic solution for oxygen diffusion from capillary to tissues involving external force effects: a fractional calculus approach
• Filon-Clenshaw-Curtis formulas for highly oscillatory integrals in the presence of stationary points
• The numerical solution of linear recurrence relations
• Moment-free numerical approximation of highly oscillatory integrals with stationary points
• The evaluation and application of some modified moments
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Is Gauss Quadrature Better than Clenshaw–Curtis?
• Computational Aspects of Three-Term Recurrence Relations
• On the Construction of Gaussian Quadrature Rules from Modified Moments

This page was built for publication: Clenshaw-Curtis algorithms for an efficient numerical approximation of singular and highly oscillatory Fourier transform integrals