C3DFFT,Z3DFFT(3) MathKeisan FFT routine C3DFFT,Z3DFFT(3)
NAME
c3dfft, z3dfft - three-dimensional FFT - complex storage mode (OpenMP)
Parallel Support.
SYNOPSIS
libfft.a
INTEGER l1, l2, l3, ldz, mdz, iopt, ier
COMPLEX z(ldz, mdz, l3)
CALL C3DFFT (z, l1, l2, l3, ldz, mdz, iopt, ier)
INTEGER l1, l2, l3, ldz, mdz, iopt, ier
COMPLEX(kind=8) z(ldz, mdz, l3)
CALL Z3DFFT (z, l1, l2, l3, ldz, mdz, iopt, ier)
libfft_64.a
INTEGER(kind=8) l1, l2, l3, ldz, mdz, iopt, ier
COMPLEX(kind=8) z(ldz, mdz, l3)
CALL C3DFFT (z, l1, l2, l3, ldz, mdz, iopt, ier)
INTEGER(kind=8) l1, l2, l3, ldz, mdz, iopt, ier
COMPLEX(kind=8) z(ldz, mdz, l3)
CALL Z3DFFT (z, l1, l2, l3, ldz, mdz, iopt, ier)
DESCRIPTION
Given an array of complex data, these subprograms compute the three-
dimensional forward or inverse discrete Fourier transform using a
mixed-radix fast Fourier transform (FFT) algorithm. A pair of compan-
ion subprograms, S3DFFT and D3DFFT, performs the same operation, but
with the complex data presented with real and imaginary parts in sepa-
rate real arrays. Set the OpenMp environmental variable
OMP_NUM_THREADS to the number of threads you would like to use.
ARGUMENTS
Input
z Array of data to be transformed.
l1 Number of rows of data (l1>0).
l2 Number of columns of data (l2>0).
l3 Number of planes of data (l3>0).
ldz The leading dimension of array z, with ldz >= l1.
mdz The middle dimension of array z, with mdz >= l2.
iopt Option flag:
iopt >= 0 Compute forward transform.
iopt < 0 Compute inverse transform.
Output
z The transformed data replaces the input if ier = 0 is returned.
ier Status response:
ier = 0 Normal return - transform successful.
ier = -1 l1 < 1.
ier = -2 l2 < 1.
ier = -3 l3 < 1.
ier = -4 ldz < l1.
ier = -5 mdz < l2.
MLIB routine C3DFFT,Z3DFFT(3)