Notes

This is really just rfftn with different default behavior. For more details see rfftn .

Parameters

x : array

Input array, taken to be real.

s : sequence of ints, optional

Shape of the FFT.

axes : sequence of ints, optional

Axes over which to compute the FFT.

norm : {"backward", "ortho", "forward"}, optional

Normalization mode (see fft ). Default is "backward".

overwrite_x : bool, optional

If True, the contents of x can be destroyed; the default is False. See fft for more details.

workers : int, optional

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.

plan : object, optional

This argument is reserved for passing in a precomputed plan provided by downstream FFT vendors. It is currently not used in SciPy.

versionadded

Returns

out : ndarray

The result of the real 2-D FFT.

Compute the 2-D FFT of a real array.

See Also

irfft2

The inverse of the 2-D FFT of real input.

rfft

The 1-D FFT of real input.

rfftn

Compute the N-D discrete Fourier Transform for real input.

Examples

See :

Back References

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

scipy.fft._basic.rfftn scipy.fft._basic.rfft scipy.fft._basic.irfft2

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/_basic.py#1114
type: <class 'uarray._Function'>
Commit: