This is really just hfftn
with different default behavior. For more details see hfftn
.
Input array, taken to be Hermitian complex.
Shape of the real output.
Axes over which to compute the FFT.
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.
The real result of the 2-D Hermitian complex real FFT.
Compute the 2-D FFT of a Hermitian complex array.
hfftn
Compute the N-D discrete Fourier Transform for Hermitian complex input.
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.fft._basic.ihfftn
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