fht(a, dln, mu, offset=0.0, bias=0.0)

Computes the discrete Hankel transform of a logarithmically spaced periodic sequence using the FFTLog algorithm , .

Notes

This function computes a discrete version of the Hankel transform

$$A(k) = \int_{0}^{\infty} \! a(r) \, J_\mu(kr) \, k \, dr \;,$$

where $J_\mu$ is the Bessel function of order $\mu$ . The index $\mu$ may be any real number, positive or negative.

The input array a is a periodic sequence of length $n$ , uniformly logarithmically spaced with spacing :None:None:`dln`,

$$a_j = a(r_j) \;, \quad r_j = r_c \exp[(j-j_c) \, \mathtt{dln}]$$

centred about the point $r_c$ . Note that the central index $j_c = (n+1)/2$ is half-integral if $n$ is even, so that $r_c$ falls between two input elements. Similarly, the output array A is a periodic sequence of length $n$ , also uniformly logarithmically spaced with spacing :None:None:`dln`

$$A_j = A(k_j) \;, \quad k_j = k_c \exp[(j-j_c) \, \mathtt{dln}]$$

centred about the point $k_c$ .

The centre points $r_c$ and $k_c$ of the periodic intervals may be chosen arbitrarily, but it would be usual to choose the product $k_c r_c = k_j r_{n-1-j} = k_{n-1-j} r_j$ to be unity. This can be changed using the :None:None:`offset` parameter, which controls the logarithmic offset $\log(k_c) = \mathtt{offset} - \log(r_c)$ of the output array. Choosing an optimal value for :None:None:`offset` may reduce ringing of the discrete Hankel transform.

If the bias parameter is nonzero, this function computes a discrete version of the biased Hankel transform

$$A(k) = \int_{0}^{\infty} \! a_q(r) \, (kr)^q \, J_\mu(kr) \, k \, dr$$

where $q$ is the value of bias , and a power law bias $a_q(r) = a(r) \, (kr)^{-q}$ is applied to the input sequence. Biasing the transform can help approximate the continuous transform of $a(r)$ if there is a value $q$ such that $a_q(r)$ is close to a periodic sequence, in which case the resulting $A(k)$ will be close to the continuous transform.

Parameters

a : array_like (..., n)

Real periodic input array, uniformly logarithmically spaced. For multidimensional input, the transform is performed over the last axis.

dln : float

Uniform logarithmic spacing of the input array.

mu : float

Order of the Hankel transform, any positive or negative real number.

offset : float, optional

Offset of the uniform logarithmic spacing of the output array.

bias : float, optional

Exponent of power law bias, any positive or negative real number.

Returns

A : array_like (..., n)

The transformed output array, which is real, periodic, uniformly logarithmically spaced, and of the same shape as the input array.

Compute the fast Hankel transform.

See Also

fhtoffset

Return an optimal offset for :None:None:`fht`.

ifht

The inverse of :None:None:`fht`.

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.fft._fftlog.fhtoffset scipy.fft._fftlog.ifht

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /scipy/fft/_fftlog.py#23
type: <class 'function'>
Commit: