Abstract:This paper is the final part in a series devoted to the development of numerically stable and efficient algorithms, together with multi-precision Fortran implementations, for computing Bessel functions with real orders and complex arguments. Parts~I and~II presented stable and efficient algorithms for the modified Bessel functions I_nu(z) and K_nu(z); here we treat Bessel functions J_nu(z) and Y_nu(z). The proposed algorithms support complex arguments for both positive and negative real orders and are implemented in native double and quadruple precision. Quadruple precision substantially increases dynamic range and accuracy (by roughly an order of magnitude in reliably computable |nu| and |z|), thereby extending applicability to problems requiring 20-30 digits. Comprehensive accuracy and performance comparisons are carried out against both the widely used Algorithm~644, restricted to double-precision arithmetic, and the more recent Algorithm~912, which supports both double- and quad-precision arithmetic as well as complex orders. In double precision, the present implementation consistently outperforms Algorithm~644, achieving execution times of approximately 35-67% for J_nu(z) and 44-72% for Y_nu(z), while also producing reliable results where Algorithm~644 fails. In comparison with Algorithm~912, the present algorithm achieves comparable accuracy in double-precision computations and significantly higher accuracy in quad-precision calculations. At the same time, it requires only a small fraction of the computational cost (from a few thousandths to a few hundredths) of the time taken by Algorithm~912, depending on the precision and parameter regime. Furthermore, unlike Algorithm~912, whose applicability is restricted to a limited region of the (Re(nu),z) plane, the present algorithm remains stable and accurate over the full tested domain for which reliable reference values are available.
From: Mofreh Zaghloul [view email]
[v1]
Fri, 12 Jun 2026 20:22:42 UTC (5,879 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。