cfft2f
cfft2f - compute the Fourier coefficients of a periodic sequence. The xFFT operations are unnormalized, so a call of xFFT2F followed by a call of xFFT2B will multiply the input sequence by M*N.
SUBROUTINE CFFT2F( M, N, A, LDA, WORK, LWORK)
COMPLEX A(LDA,*)
INTEGER M, N, LDA, LWORK
REAL WORK(*)
SUBROUTINE CFFT2F_64( M, N, A, LDA, WORK, LWORK)
COMPLEX A(LDA,*)
INTEGER*8 M, N, LDA, LWORK
REAL WORK(*)
SUBROUTINE FFT2F( [M], [N], A, [LDA], WORK, LWORK)
COMPLEX, DIMENSION(:,:) :: A
INTEGER :: M, N, LDA, LWORK
REAL, DIMENSION(:) :: WORK
SUBROUTINE FFT2F_64( [M], [N], A, [LDA], WORK, LWORK)
COMPLEX, DIMENSION(:,:) :: A
INTEGER(8) :: M, N, LDA, LWORK
REAL, DIMENSION(:) :: WORK
#include <sunperf.h>
void cfft2f(int m, int n, complex *a, int lda, float *work, int lwork);
void cfft2f_64(long m, long n, complex *a, long lda, float *work, long lwork);
-
* M (input)
-
Number of rows to be transformed. These subroutines are most efficient when M is a product of small primes. M >= 0.
-
* N (input)
-
Number of columns to be transformed. These subroutines are most efficient when N is a product of small primes. N >= 0.
-
* A (input/output)
-
On entry, a two-dimensional array A(M,N) that contains the sequences to be transformed.
-
* LDA (input)
-
Leading dimension of the array containing the data to be transformed. LDA >= M.
-
* WORK (input)
-
On input, workspace WORK must have been initialized by CFFT2I.
-
* LWORK (input)
-
The dimension of the array WORK. LWORK >= (4 * (M + N) + 30)