fht

scirs2_fft::fht

Function fht 

Source 
pub fn fht(
    a: &[f64],
    dln: f64,
    mu: f64,
    offset: Option<f64>,
    bias: Option<f64>,
) -> FFTResult<Vec<f64>>
Expand description

Fast Hankel Transform using FFTLog algorithm

Computes the discrete Hankel transform of a logarithmically spaced periodic sequence. This is the FFTLog algorithm by Hamilton (2000).

§Arguments

  • a - Real input array, logarithmically spaced
  • dln - Uniform logarithmic spacing of the input array
  • mu - Order of the Bessel function
  • offset - Offset of the uniform logarithmic spacing (default 0.0)
  • bias - Index of the power law bias (default 0.0)

§Returns

The transformed output array