Efficient Calculation of Modified Bessel Functions of the First Kind, I_ν (z), for Real Orders and Complex Arguments: Fortran Implementation with Double and Quadruple Precision

2025/05/14 by Zaghloul, Mofreh R., Johnson, Steven G. · 1 citation
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2505.09770

Abstract

We present an efficient self-contained algorithm for computing the modified Bessel function of the first kind I_ν(z), implemented in a robust Fortran code supporting double and quadruple (quad) precision. The algorithm overcomes the limitations of Algorithm 644, which is restricted to double precision and applies overly conservative underflow and overflow thresholds, leading to failures in large parameter regions. Accuracy is validated against high-precision Maple calculations, and benchmarking shows execution time reductions to 54%-80% of Algorithm 644 (in double precision). Quad precision enhances numerical stability and broadens the domain of computations, making the implementation well suited for high-precision applications in physics and engineering. This work also provides a foundation for the development of efficient algorithms for other Bessel functions.

Cited by

• On Geometric Structures for Policy Parameterization in Continuous Control

Related

• Algorithm xxx: Modified Bessel functions of imaginary order and positive argument
• Algorithm 644
• An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments
• On the Computation of the Logarithm of the Modified Bessel Function of the Second Kind
• Fast parallel calculation of modified Bessel function of the second kind and its derivatives