1 subroutine sinq1i ( n, wsave, lensav, ier )
3 !*****************************************************************************80
5 !! SINQ1I: initialization for SINQ1B and SINQ1F.
9 ! SINQ1I initializes array WSAVE for use in its companion routines
10 ! SINQ1F and SINQ1B. The prime factorization of N together with a
11 ! tabulation of the trigonometric functions are computed and stored
12 ! in array WSAVE. Separate WSAVE arrays are required for different
16 ! Copyright (C) 1995-2004, Scientific Computing Division,
17 ! University Corporation for Atmospheric Research
31 ! Vectorizing the Fast Fourier Transforms,
32 ! in Parallel Computations,
33 ! edited by G. Rodrigue,
34 ! Academic Press, 1982.
37 ! Fast Fourier Transform Algorithms for Vector Computers,
38 ! Parallel Computing, pages 45-63, 1984.
42 ! Input, integer ( kind = 4 ) N, the length of the sequence to be
43 ! transformed. The transform is most efficient when N is a product of
46 ! Input, integer ( kind = 4 ) LENSAV, the dimension of the WSAVE array.
47 ! LENSAV must be at least 2*N + INT(LOG(REAL(N))) + 4.
49 ! Output, real ( kind = 4 ) WSAVE(LENSAV), containing the prime factors
50 ! of N and also containing certain trigonometric values which will be used
51 ! in routines SINQ1B or SINQ1F.
53 ! Output, integer ( kind = 4 ) IER, error flag.
55 ! 2, input parameter LENSAV not big enough;
56 ! 20, input error returned by lower level routine.
60 integer ( kind = 4 ) lensav
62 integer ( kind = 4 ) ier
63 integer ( kind = 4 ) ier1
64 integer ( kind = 4 ) n
65 real ( kind = 4 ) wsave(lensav)
69 if ( lensav < 2 * n + int ( log ( real ( n, kind = 4 ) ) ) + 4 ) then
71 call xerfft ( 'sinq1i', 3 )
75 call cosq1i ( n, wsave, lensav, ier1 )
79 call xerfft ( 'sinq1i', -5 )