Abstract
The aim of the paper is to propose an efficient and stable algorithm that is quite accurate and fast for numerical evaluation of the Fourier-Bessel transform of order ν, ν>-1, using wavelets. The philosophy behind the proposed algorithm is to replace the part tf(t) of the integral by its wavelet decomposition obtained by using CAS wavelets thus representing Fν(p) as a Fourier-Bessel series with coefficients depending strongly on the input function tf(t). The wavelet method indicates that the approach is easy to implement and thus computationally very attractive.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
