1995
DOI: 10.1016/0377-0427(95)00142-5
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating infinite integrals involving Bessel functions of arbitrary order

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
32
0

Year Published

1996
1996
2018
2018

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 63 publications
(32 citation statements)
references
References 13 publications
0
32
0
Order By: Relevance
“…Since a significant fraction of the overall computational effort is typically spent on the tail integral, it is essential that this integration be done as efficiently as possible. The proven and most popular approach is the integration then summation procedure [2]- [4] in which the integral is evaluated as a sum of a series of partial integrals over finite subintervals as follows: (2) with (3) where with and is a sequence of suitably selected interpolation points. These break points may be selected based on the asymptotic behavior of the integrand .…”
Section: Introductionmentioning
confidence: 99%
“…Since a significant fraction of the overall computational effort is typically spent on the tail integral, it is essential that this integration be done as efficiently as possible. The proven and most popular approach is the integration then summation procedure [2]- [4] in which the integral is evaluated as a sum of a series of partial integrals over finite subintervals as follows: (2) with (3) where with and is a sequence of suitably selected interpolation points. These break points may be selected based on the asymptotic behavior of the integrand .…”
Section: Introductionmentioning
confidence: 99%
“…The component integrals are then evaluated by treating the areas between integrand zeros as terms in alternating series which are readily summed by the well-known accelerated ε-convergence method. A single series summation (Lucas and Stone, 1995) results when r = 0 in U 3 (r, z, p).…”
Section: Numerical Evaluationsmentioning
confidence: 99%
“…These integrand functions, which are highly oscillatory, are very challenging to evaluate to high precision. We employed tanh-sinh quadrature and Gaussian quadrature, together with the Sidi mW extrapolation algorithm, as described in a 1994 paper by Lucas and Stone [78], which, in turn, is based on two earlier papers by Sidi [79,80]. While the computations were relatively expensive, we were able to compute 1000-digit values of these integrals for odd n up to 17 [76].…”
Section: Ramble Integralsmentioning
confidence: 99%