uirfft2(inarray, shape=None)
Compute the real inverse Fourier transform on the last 2 axes. This transform considers the Hermitian property of the transform from complex to real-valued input.
The array to transform.
The shape of the output. The shape of rfft
is ambiguous in case of odd-valued input shape. In this case, this parameter should be provided. See np.fft.irfftn
.
The unitary 2-D inverse real Fourier transform of inarray
.
2-dimensional inverse real unitary Fourier transform.
>>> input = np.ones((10, 128, 128))This example is valid syntax, but we were not able to check execution
... output = uirfftn(urfftn(input), shape=input.shape)
... np.allclose(input, output) True
>>> output.shape (10, 128, 128)See :
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