Calculates the inverse of rfft, scaled by n (You can use scale
to normalize the result). Before the method is called, data should contain a
complex sequence in the same format as the result of rfft. It is
assumed that the input sequence is a discrete fourier transform of a real
valued sequence, so the elements of the input sequence not stored in data
can be calculated from DFT(f)i = DFT(f)[n - i]*. When the method
completes, the array contains the real part of the inverse discrete fourier
transform. The imaginary part is known to be equal to 0.
The length of the array must be equal to n and the array must be properly
aligned. To obtain a properly aligned array you can use allocate.
Calculates the inverse of rfft, scaled by n (You can use scale to normalize the result). Before the method is called, data should contain a complex sequence in the same format as the result of rfft. It is assumed that the input sequence is a discrete fourier transform of a real valued sequence, so the elements of the input sequence not stored in data can be calculated from DFT(f)i = DFT(f)[n - i]*. When the method completes, the array contains the real part of the inverse discrete fourier transform. The imaginary part is known to be equal to 0.
The length of the array must be equal to n and the array must be properly aligned. To obtain a properly aligned array you can use allocate.