Function ndrustfft::ndifft

pub fn ndifft<R, S, T, D>(
    input: &mut ArrayBase<R, D>, 
    output: &mut ArrayBase<S, D>, 
    handler: &mut FftHandler<T>, 
    axis: usize
) where
    T: FftNum,
    R: Data<Elem = Complex<T>>,
    S: Data<Elem = Complex<T>> + DataMut,
    D: Dimension, 

Complex-to-complex Inverse Fourier Transform (serial).

Example

use ndarray::Array2;
use ndrustfft::{ndfft, ndifft, Complex, FftHandler};

let (nx, ny) = (6, 4);
let mut data = Array2::<Complex<f64>>::zeros((nx, ny));
let mut vhat = Array2::<Complex<f64>>::zeros((nx, ny));
for (i, v) in data.iter_mut().enumerate() {
    v.re = i as f64;
    v.im = -1.0*i as f64;
}
let mut handler: FftHandler<f64> = FftHandler::new(ny);
ndfft(&mut data, &mut vhat, &mut handler, 1);
ndifft(&mut vhat, &mut data, &mut handler, 1);