Error Bounds for Numerical Integration of Oscillatory Bessel Transforms with Algebraic or Logarithmic Singularities
Abstract: In this paper, we present and analyze the Clenshaw-Curtis-Filon methods for computing two classes of oscillatory Bessel transforms with algebraic or logarithmic singularities. More importantly, for these quadrature rules we derive new computational sharp error bounds by rigorous proof. These new error bounds share the advantageous property that some error bounds are optimal on $\omega$ for fixed $N$, while other error bounds are optimal on $N$ for fixed $\omega$. Furthermore, we prove from the presented error bounds in inverse powers of $\omega$ that the accuracy improves greatly, for fixed $N$, as $\omega$ increases.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.