Automatic Differentiation
 
Loading...
Searching...
No Matches

◆ inv_fft2() [2/2]

template<typename M , require_eigen_dense_dynamic_vt< is_complex, M > * = nullptr, require_var_t< base_type_t< value_type_t< M > > > * = nullptr>
plain_type_t< M > stan::math::inv_fft2 ( const M &  y)
inline

Return the two-dimensional inverse discrete Fourier transform of the specified complex matrix.

The 2D inverse discrete Fourier transform first runs the 1D inverse Fourier transform on the columns, and then on the resulting rows. The composition of the FFT and inverse FFT (or vice-versa) is the identity.

The adjoint computation is given by

adjoint(y) += (1 / size(x)) * fft2(adjoint(x))
size_t size(const T &m)
Returns the size (number of the elements) of a matrix_cl or var_value<matrix_cl<T>>.
Definition size.hpp:18
Eigen::Matrix< scalar_type_t< M >, -1, -1 > fft2(const M &x)
Return the two-dimensional discrete Fourier transform of the specified complex matrix.
Definition fft.hpp:87
Template Parameters
Mtype of complex matrix argument
Parameters
[in]ymatrix to inverse trnasform
Returns
inverse discrete 2D Fourier transform of y

Definition at line 155 of file fft.hpp.