Investigation into the role of the Bessel function order in the Fourier-Bessel series and the Hankel Transform

2025/03/22 by Patni, Suketu P, Gadre, Vikram M
#FOS: Electrical engineering #Signal Processing (eess.SP) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.2503.17722

Abstract

This work focuses on estimating the number of terms of a Fourier-Bessel series of order p' required to get within a certain error of a Bessel function of a fixed order p where p ≠ p'. Our approach consists of two steps: one, constructing an invariant over n of the n^th order Hankel transform; and two, observing the effect of expanding a suitably scaled Bessel function of a fixed order p in its Fourier-Bessel series of order p'. We demonstrate a new error metric to simplify the error computations. Further, we generate an empirical model using numerical simulations and examine its capabilities in predicting the number of terms required.

Related

• An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments
• How Not to Compute a Fourier Transform
• A fast analysis-based discrete Hankel transform using asymptotic expansions
• Besov-Hankel norms in terms of the Continuous Bessel wavelet transform
• Discrete Bessel functions and transform