A Note on Log Scale Hankel Transforms
✍ Scribed by M. vanVeldhuizen; R. Nieuwenhuizen; W. Zijl
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 230 KB
- Volume
- 110
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
✦ Synopsis
The Siegman-Talman approximation of the Hankel transform may suffer from rounding errors caused by premultiplication by an exponential function. The main result of this note is a modification of the Siegman-Taiman algorithm for the approximation of the Hankel transform (H_{0}). The modified algorithm is just as fast as the Siegman-Talman algorithm, but it cures the problem of rounding errors. (c) 1994 Academic Press, Inc.
📜 SIMILAR VOLUMES
## Abstract An integral transform with a kernel generalizing the Bessel function of the first kind is investigated in weighted __L~p~__–spaces. Mapping properties, such as the boundedness, the representation and the range of the transform, are given and an inversion formula is proved. (© 2003 WILEY
## Abstract We determine bounds for the spectral and 𝓁~__p__~ norm of Cauchy–Hankel matrices of the form __H__~__n__~=[1/(__g__+__h__(__i__+__j__))]^__n__^~__i,j__=1~≡ ([1/(__g__+__kh__)]^__n__^~__i,j__=1~), __k__=0, 1,…, __n__ –1, where __k__ is defined by __i__+__j__=__k__ (mod __n__). Copyright