[ новости /+++ | форум | теги | ]

NAME
     zfft3f - compute the  Fourier  coefficients  of  a  periodic
     sequence.   The  xFFT operations are unnormalized, so a call
     of xFFT3F followed by a call of  xFFT3B  will  multiply  the
     input sequence by M*N*K.

SYNOPSIS
     SUBROUTINE CFFT3F (M, N, K, CX, LDX, LD2X, RWSAVE, LWSAVE)

     SUBROUTINE ZFFT3F (M, N, K, ZX, LDX, LD2X, DWSAVE, LWSAVE)



     #include <sunperf.h>

     void cfft3f (int m, int n, int k, complex *cx, int ldx,  int
               ld2x, complex *wsave, int lwsave);

     void zfft3f (int m, int n, int  k,  doublecomplex  *zx,  int
               ldx, int ld2x, doublecomplex *wsave, int lwsave);

ARGUMENTS
     M         Number of rows to be transformed.   These  subrou-
               tines  are  most  efficient when M is a product of
               small primes.  M >= 0.

     N         Number of columns to be transformed.   These  sub-
               routines are most efficient when N is a product of
               small primes.  N >= 0.

     K         Number of planes to be transformed.  These subrou-
               tines  are  most  efficient when K is a product of
               small primes.  K >= 0.

     xX        On entry, a three-dimensional array xX(M,N,K) that
               contains the sequences to be transformed.

     LDX       Leading dimension of the array containing the data
               to be transformed.  LDX >= M.

     LD2X      Second dimension of the array containing the  data
               to be transformed.  LD2X >= N.

     xWSAVE    Scratch array.  xWSAVE must have been  initialized
               by xFFT3I.

     LWSAVE    Length of  WSAVE.   LWSAVE  >=  (4  *  (M  +  N  +
               MAX(M,N,K)) + 45).

Партнёры:

Хостинг: