numpy.fft.rfft2#

fft.rfft2(a,s=None,axes=(-2,-1),norm=None,out=None)[source]#

Compute the 2-dimensional FFT of a real array.

Parameters:

aarray

Input array, taken to be real.

ssequence of ints, optional

Shape of the FFT.

Changed in version 2.0:If it is-1, the whole input is used (no padding/trimming).

Deprecated since version 2.0:Ifs is notNone,axes must not beNone either.

Deprecated since version 2.0:s must contain onlyint s, notNone values.Nonevalues currently mean that the default value forn is usedin the corresponding 1-D transform, but this behaviour isdeprecated.

axessequence of ints, optional

Axes over which to compute the FFT. Default:(-2,-1).

Deprecated since version 2.0:Ifs is specified, the correspondingaxes to be transformedmust not beNone.

norm{“backward”, “ortho”, “forward”}, optional

Normalization mode (seenumpy.fft). Default is “backward”.Indicates which direction of the forward/backward pair of transformsis scaled and with what normalization factor.

New in version 1.20.0:The “backward”, “forward” values were added.

outcomplex ndarray, optional

If provided, the result will be placed in this array. It should beof the appropriate shape and dtype for the last inverse transform.incompatible with passing in all but the trivials).

New in version 2.0.0.

Returns:

outndarray

The result of the real 2-D FFT.

See also

rfftn

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

Notes

This is really justrfftn with different default behavior.For more details seerfftn.

Examples

Try it in your browser!

>>>importnumpyasnp>>>a=np.mgrid[:5,:5][0]>>>np.fft.rfft2(a)array([[ 50.  +0.j        ,   0.  +0.j        ,   0.  +0.j        ],       [-12.5+17.20477401j,   0.  +0.j        ,   0.  +0.j        ],       [-12.5 +4.0614962j ,   0.  +0.j        ,   0.  +0.j        ],       [-12.5 -4.0614962j ,   0.  +0.j        ,   0.  +0.j        ],       [-12.5-17.20477401j,   0.  +0.j        ,   0.  +0.j        ]])

Go BackOpen In Tab