1 subroutine cfft1i ( n, wsave, lensav, ier )
3 !*****************************************************************************80
5 !! CFFT1I: initialization for CFFT1B and CFFT1F.
9 ! CFFT1I initializes array WSAVE for use in its companion routines
10 ! CFFT1B and CFFT1F. Routine CFFT1I must be called before the first
11 ! call to CFFT1B or CFFT1F, and after whenever the value of integer
15 ! Copyright (C) 1995-2004, Scientific Computing Division,
16 ! University Corporation for Atmospheric Research
30 ! Vectorizing the Fast Fourier Transforms,
31 ! in Parallel Computations,
32 ! edited by G. Rodrigue,
33 ! Academic Press, 1982.
36 ! Fast Fourier Transform Algorithms for Vector Computers,
37 ! Parallel Computing, pages 45-63, 1984.
41 ! Input, integer ( kind = 4 ) N, the length of the sequence to be
42 ! transformed. The transform is most efficient when N is a product
45 ! Input, integer ( kind = 4 ) LENSAV, the dimension of the WSAVE array.
46 ! LENSAV must be at least 2*N + INT(LOG(REAL(N))) + 4.
48 ! Output, real ( kind = 4 ) WSAVE(LENSAV), containing the prime factors
49 ! of N and also containing certain trigonometric values which will be used
50 ! in routines CFFT1B or CFFT1F.
52 ! Output, integer ( kind = 4 ) IER, error flag.
54 ! 2, input parameter LENSAV not big enough.
58 integer ( kind = 4 ) lensav
60 integer ( kind = 4 ) ier
61 integer ( kind = 4 ) iw1
62 integer ( kind = 4 ) n
63 real ( kind = 4 ) wsave(lensav)
67 if ( lensav < 2 * n + int ( log ( real ( n, kind = 4 ) ) ) + 4 ) then
69 call xerfft ( 'CFFT1I', 3 )
79 call r4_mcfti1 ( n, wsave, wsave(iw1), wsave(iw1+1) )