1998
DOI: 10.1364/ol.23.000409
|View full text |Cite
|
Sign up to set email alerts
|

Quasi-discrete Hankel transform

Abstract: A quasi-discrete Hankel transform (QDHT) is presented as a new and efficient framework for numerical evaluation of the zero-order Hankel transform. A discrete form of Parseval's theorem is obtained for the first time to the authors' knowledge, and the transform matrix is discussed. It is shown that the S factor, defined as the products of a truncated radius, is critical to building the QDHT.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
59
0

Year Published

2004
2004
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 115 publications
(62 citation statements)
references
References 4 publications
0
59
0
Order By: Relevance
“…The zeroth-order Hankel transform in the continuous case keeps the fundamental property of the Fourier transform we need: convolutions are converted to products in the transformed space. 21 Now we turn to the discrete zeroth-order Hankel transform, [22][23][24] which is the form of this transform that we will use in fact. It is analogous to the discrete Fourier transform, which is actually used in many physical problems instead of the Fourier transform definition.…”
Section: Iic the Zeroth-order Hankel Transform "Fourierbessel Transmentioning
confidence: 99%
See 2 more Smart Citations
“…The zeroth-order Hankel transform in the continuous case keeps the fundamental property of the Fourier transform we need: convolutions are converted to products in the transformed space. 21 Now we turn to the discrete zeroth-order Hankel transform, [22][23][24] which is the form of this transform that we will use in fact. It is analogous to the discrete Fourier transform, which is actually used in many physical problems instead of the Fourier transform definition.…”
Section: Iic the Zeroth-order Hankel Transform "Fourierbessel Transmentioning
confidence: 99%
“…This means that the Bessel functions set forms a near-orthogonal base, instead of an orthogonal base, 23,24 when a finite series of functions is taken. But, as the base is very close to be orthogonal strictu sensu, in practice the convolution property can be used.…”
Section: Iic the Zeroth-order Hankel Transform "Fourierbessel Transmentioning
confidence: 99%
See 1 more Smart Citation
“…Following earlier works, we applied a quasi-discrete Hankel transform (QDHT) routine (Yu et al, 1998;Guizar-Sicairos & GutierrezVega, 2004) to model diffractive X-ray optics because it gives a very high accuracy agreement with the exact analytical transforms and it requires neither the interpolation of the data points nor the use of extensive zero padding. Unlike other Hankel transform algorithms such as the one used by VilaComamala et al (2011), the QDHT is energy preserving by construction and the original function is retrieved after two successive applications of the Hankel transform with a precision comparable with the fast Fourier transform routines.…”
Section: Methodsmentioning
confidence: 99%
“…And the most robust algorithm is for J 0 (ks)-transform which has been devised by Lado, 39 and more than two decades later was rediscovered by Yu et al 40 The transforms of higher (even) order are reduced to zero order transform by special "raising" and "lowering" operations. 6,37 According to Lado's recipe, 39 we assume that the function f(s) is defined for s ≥ 0, that f(s) vanishes for s ≥ S, and that its Fourier (Hankel) transformf (k) vanishes for k ≥ K, i.e., the function is band-limited both in space and in frequency.…”
Section: Appendix A: Numerical Hankel Transformsmentioning
confidence: 99%