This function computes the inverse of the N-D discrete Fourier Transform for real input over any number of axes in an M-D array by means of the Fast Fourier Transform (FFT). In other words, irfftn(rfftn(x), x.shape) == x
to within numerical accuracy. (The a.shape
is necessary like len(a)
is for irfft
, and for the same reason.)
The input should be ordered in the same way as is returned by rfftn
, i.e., as for irfft
for the final transformation axis, and as for ifftn
along all the other axes.
See fft
for definitions and conventions used.
See rfft
for definitions and conventions used for real input.
The default value of s assumes an even output length in the final transformation axis. When performing the final complex to real transformation, the Hermitian symmetry requires that the last imaginary component along that axis must be 0 and so it is ignored. To avoid losing information, the correct length of the real input must be given.
Input array.
Shape (length of each transformed axis) of the output ( s[0]
refers to axis 0, s[1]
to axis 1, etc.). s is also the number of input points used along this axis, except for the last axis, where s[-1]//2+1
points of the input are used. Along any axis, if the shape indicated by s is smaller than that of the input, the input is cropped. If it is larger, the input is padded with zeros. If s is not given, the shape of the input along the axes specified by axes is used. Except for the last axis which is taken to be 2*(m-1)
, where m
is the length of the input along that axis.
Axes over which to compute the inverse FFT. If not given, the last :None:None:`len(s)` axes are used, or all axes if s is also not specified.
Normalization mode (see fft
). Default is "backward".
If True, the contents of x can be destroyed; the default is False. See fft
for more details.
Maximum number of workers to use for parallel computation. If negative, the value wraps around from os.cpu_count()
. See ~scipy.fft.fft
for more details.
This argument is reserved for passing in a precomputed plan provided by downstream FFT vendors. It is currently not used in SciPy.
If s and :None:None:`axes` have different length.
If an element of :None:None:`axes` is larger than than the number of axes of x.
The truncated or zero-padded input, transformed along the axes indicated by :None:None:`axes`, or by a combination of s or x, as explained in the parameters section above. The length of each transformed axis is as given by the corresponding element of s, or the length of the input in every axis except for the last one if s is not given. In the final transformed axis the length of the output when s is not given is 2*(m-1)
, where m
is the length of the final transformed axis of the input. To get an odd number of output points in the final axis, s must be specified.
Computes the inverse of rfftn
fft
The 1-D FFT, with definitions and conventions used.
irfft
The inverse of the 1-D FFT of real input.
irfft2
The inverse of the 2-D FFT of real input.
rfftn
The forward N-D FFT of real input, of which :None:None:`ifftn` is the inverse.
>>> import scipy.fftSee :
... x = np.zeros((3, 2, 2))
... x[0, 0, 0] = 3 * 2 * 2
... scipy.fft.irfftn(x) array([[[1., 1.], [1., 1.]], [[1., 1.], [1., 1.]], [[1., 1.], [1., 1.]]])
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.fft._basic.rfftn
scipy.fft._basic.irfft
scipy.fft._basic.irfft2
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