Hi Stefan,
indeed you're right, the underlying formula initially was created by V.
Tutatchikov for power-of-two matrices. The initial butterfly approach requires
a recursive breakdown to 2x2 matrix in order to proceed with precalculations of
roots of unity (exactly what provides you the aforem
Hi Alexander,
On 2024-03-14 22:43:38, Alexander Levin via NumPy-Discussion
wrote:
Memory Usage -
https://github.com/2D-FFT-Project/2d-fft/blob/testnotebook/notebooks/memory_usage.ipynb
Timing comparisons(updated) -
https://github.com/2D-FFT-Project/2d-fft/blob/testnotebook/notebooks/comparis
Good day, Ralf.
I am sharing the results of the latest updates on our code. We have taken into
account the comments below and are testing the timing with %timeit -o inside
jupyter, having information about the best of 7 code passes and the average
deviation. Writing to summarise the intermediat
The following reduction functions receive a "where" argument:
- https://numpy.org/doc/stable/reference/generated/numpy.max.html
- https://numpy.org/doc/stable/reference/generated/numpy.min.html
- https://numpy.org/doc/stable/reference/generated/numpy.sum.html
- https://numpy.org/doc/stable/referenc
