Fast Hankel Transforms Algorithm Based on Kernel Function Interpolation with Exponential Functions | Zendy

Huaiqing Zhang | Zendy; Yu Chen | Zendy; Xin Nie | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Fast Hankel Transforms Algorithm Based on Kernel Function Interpolation with Exponential Functions

Author(s) -

Huaiqing Zhang,

Yu Chen,

Xin Nie

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/105469

Subject(s) - mathematics , kernel (algebra) , hankel transform , interpolation (computer graphics) , piecewise , algorithm , function (biology) , exponential function , monotonic function , mathematical optimization , bessel function , computer science , mathematical analysis , discrete mathematics , artificial intelligence , motion (physics) , evolutionary biology , biology

The Pravin method for Hankel transforms is based on the decomposition of kernel function with exponential function. The defect of such method is the difficulty in its parameters determination and lack of adaptability to kernel function especially using monotonically decreasing functions to approximate the convex ones. This thesis proposed an improved scheme by adding new base function in interpolation procedure. The improved method maintains the merit of Pravin method which can convert the Hankel integral to algebraic calculation. The simulation results reveal that the improved method has high precision, high efficiency, and good adaptability to kernel function. It can be applied to zero-order and first-order Hankel transforms

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research