期刊
NUMERICAL ALGORITHMS
卷 92, 期 1, 页码 973-983出版社
SPRINGER
DOI: 10.1007/s11075-022-01438-0
关键词
Incomplete Bessel functions; Extrapolation methods; The G transformation; Numerical integration; The Slevinsky-Safouhi formulae
This study improves the algorithm for computing incomplete Bessel functions by developing a recurrence relation and reducing the complexity. The results show extremely high accuracy.
In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the G(n)((1)) transformation and Slevinsky-Safouhi formula for differentiation. In the present contribution, we improve this existing algorithm for incomplete Bessel functions by developing a recurrence relation for the numerator sequence and the denominator sequence whose ratio forms the sequence of approximations. By finding this recurrence relation, we reduce the complexity from O(n(4)) to O(n). We plot relative error showing that the algorithm is capable of extremely high accuracy for incomplete Bessel functions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据