rfft1i
C RFFT1I SOURCE BP208322 18/10/08 21:15:18 9952
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
C
C FFTPACK 5.1
C
C Authors: Paul N. Swarztrauber and Richard A. Valent
c
c FFTPACK 5.1 routine RFFT2I initializes real array WSAVE for use
c in its companion routines RFFT2F and RFFT2B for computing the two-
c dimensional fast Fourier transform of real data. Prime
c factorizations of L and M, together with tabulations of the
c trigonometric functions, are computed and stored in array WSAVE.
c RFFT2I must be called prior to the first call to RFFT2F or RFFT2B.
c Separate WSAVE arrays are required for different values of L or M.
c
c Input Arguments
c
c L Integer number of elements to be transformed in the first
c dimension. The transform is most efficient when L is a
c product of small primes.
c
c M Integer number of elements to be transformed in the second
c dimension. The transform is most efficient when M is a
c product of small primes.
c
c LENSAV Integer number of elements in the WSAVE array. LENSAV must
c be at least L + 3*M + INT(LOG(REAL(L))/LOG(2.)) +
c 2*INT(LOG(REAL(M))/LOG(2.)) +12.
c
c
c Output Arguments
c
c WSAVE Real work array with dimension LENSAV, containing the
c prime factors of L and M, and also containing certain
c trigonometric values which will be used in routines
c RFFT2B or RFFT2F.
c
c
c IER Integer error return
c = 0 successful exit
c = 2 input parameter LENSAV not big enough
c = 20 input error returned by lower level routine
C
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
IMPLICIT INTEGER(I-N)
IMPLICIT REAL*8(A-H,O-Z)
INTEGER N, LENSAV, IER
REAL*8 WSAVE(LENSAV)
C
IER = 0
C
IF (LENSAV .LT. N + INT(LOG(REAL(N))/LOG(2.)) +4) THEN
IER = 2
c CALL XERFFT ('RFFT1I ', 3)
return
ENDIF
C
IF (N .EQ. 1) RETURN
C
RETURN
END
					© Cast3M 2003 - Tous droits réservés.
					Mentions légales