![]() |
Ginkgo Generated from branch based on main. Ginkgo version 1.11.0
A numerical linear algebra library targeting many-core architectures
|
This LinOp implements a 3D Fourier matrix using the FFT algorithm. More...
#include <ginkgo/core/matrix/fft.hpp>
Public Types | |
| using | value_type = std::complex<double> |
| using | index_type = int64 |
| using | transposed_type = Fft3 |
| Public Types inherited from gko::EnablePolymorphicAssignment< Fft3 > | |
| using | result_type |
Public Member Functions | |
| std::unique_ptr< LinOp > | transpose () const override |
| Returns a LinOp representing the transpose of the Transposable object. | |
| std::unique_ptr< LinOp > | conj_transpose () const override |
| Returns a LinOp representing the conjugate transpose of the Transposable object. | |
| void | write (matrix_data< std::complex< float >, int32 > &data) const override |
| void | write (matrix_data< std::complex< float >, int64 > &data) const override |
| void | write (matrix_data< std::complex< double >, int32 > &data) const override |
| void | write (matrix_data< std::complex< double >, int64 > &data) const override |
| dim< 3 > | get_fft_size () const |
| bool | is_inverse () const |
| Public Member Functions inherited from gko::EnableLinOp< Fft3 > | |
| const Fft3 * | apply (ptr_param< const LinOp > b, ptr_param< LinOp > x) const |
| Public Member Functions inherited from gko::EnablePolymorphicAssignment< Fft3 > | |
| void | convert_to (result_type *result) const override |
| void | move_to (result_type *result) override |
Static Public Member Functions | |
| static std::unique_ptr< Fft3 > | create (std::shared_ptr< const Executor > exec) |
| Creates an empty Fourier matrix. | |
| static std::unique_ptr< Fft3 > | create (std::shared_ptr< const Executor > exec, size_type size) |
| Creates an Fourier matrix with the given dimensions. | |
| static std::unique_ptr< Fft3 > | create (std::shared_ptr< const Executor > exec, size_type size1, size_type size2, size_type size3, bool inverse=false) |
| Creates an Fourier matrix with the given dimensions. | |
Friends | |
| class | EnablePolymorphicObject< Fft3, LinOp > |
This LinOp implements a 3D Fourier matrix using the FFT algorithm.
For indexing purposes, the first dimension is the major axis.
It implements complex-to-complex forward and inverse FFT.
For a power-of-two sizes 


![\[ x_{k_1 n_2 n_3 + k_2 n_3 + k_3} = \sum_{i_1=0}^{n_1-1}
\sum_{i_2=0}^{n_2-1} \sum_{i_3=0}^{n_3-1}
\omega^{i_1 k_1 + i_2 k_2 + i_3 k_3}
b_{i_1 n_2 n_3 + i_2 n_3 + i_3}
\]](form_84.png)
without normalization factors.
The Reference and OpenMP implementations support only power-of-two input sizes, as they use the Radix-2 algorithm by J. W. Cooley and J. W. Tukey, "An Algorithm for the Machine Calculation of Complex Fourier Series," Mathematics of Computation, vol. 19, no. 90, pp. 297–301, 1965, doi: 10.2307/2003354. The CUDA and HIP implementations use cuSPARSE/hipSPARSE with full support for non-power-of-two input sizes and special optimizations for products of small prime powers.
|
overridevirtual |
Returns a LinOp representing the conjugate transpose of the Transposable object.
Implements gko::Transposable.
|
static |
Creates an empty Fourier matrix.
| exec | Executor associated to the matrix |
|
static |
Creates an Fourier matrix with the given dimensions.
| size | size of all FFT dimensions |
|
static |
Creates an Fourier matrix with the given dimensions.
| size1 | size of the first FFT dimension |
| size2 | size of the second FFT dimension |
| size3 | size of the third FFT dimension |
| inverse | true to compute an inverse DFT instead of a normal DFT |
|
overridevirtual |
Returns a LinOp representing the transpose of the Transposable object.
Implements gko::Transposable.