English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In a previous work, we developed an algorithm for the computation ofincomplete 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 incompleteBessel functions by developing a recurrence relation for the numerator sequenceand the denominator sequence whose ratio forms the sequence of approximations.By finding this recurrence relation, we reduce the complexity from ${\calO}(n^4)$ to ${\cal O}(n)$. We plot relative error showing that the algorithm iscapable of extremely high accuracy for incomplete Bessel functions.

A recursive algorithm for an efficient and accurate computation of incomplete Bessel functions