IMA Journal of Numerical Analysis · 2011 · 122 citations · 31 references
Natural SciencesMathematicsMathematics EducationMathematical PhysicsScientific ComputingTime Series AnalysisFourier AnalysisNumerical AnalysisBessel FunctionsFourier-bessel Series
We consider a Clenshaw–Curtis–Filon-type method for highly oscillatory Bessel transforms. It is based on a special Hermite interpolation polynomial at the Clenshaw–Curtis points that can be efficiently evaluated using O(NlogN) operations, where N is the number of Clenshaw–Curtis points in the interval of integration. Moreover, we derive corresponding error bounds in terms of the frequency and the approximating polynomial. We then show that this method yields an efficient numerical approximation scheme for a class of Volterra integral equations containing highly oscillatory Bessel kernels (a problem for which standard numerical methods fail), and it also allows the study of the asymptotics of the solutions. Numerical examples are used to illustrate the efficiency and accuracy of the Clenshaw–Curtis–Filon-type method for approximating these highly oscillatory integrals and integral equations.
31
A Treatise on the Theory of Bessel Functions.
Matthew Porter, G. N. Watson · American Mathematical Monthly · 1923 · 9.6K citations
Mathematical Methods for Physicists
George B. Arfken, Jon Mathews · American Journal of Physics · 1972 · 4.1K citations
The Special Functions and Their Approximations
C. W. Clenshaw, Yudell L. Luke · Mathematics of Computation · 1972 · 1.5K citations
Approximation Theory and Methods.
Lars B. Wahlbin, M. J. D. Powell · Mathematics of Computation · 1982 · 825 citations
Is Gauss Quadrature Better than Clenshaw–Curtis?
Lloyd N. Trefethen · SIAM Review · 2008 · 631 citations