1 subroutine msntf1 ( lot, jump, n, inc, x, wsave, dsum, xh, work, ier )
3 !*****************************************************************************80
5 !! MSNTF1 is an FFTPACK5 auxiliary routine.
8 ! Copyright (C) 1995-2004, Scientific Computing Division,
9 ! University Corporation for Atmospheric Research
23 ! Vectorizing the Fast Fourier Transforms,
24 ! in Parallel Computations,
25 ! edited by G. Rodrigue,
26 ! Academic Press, 1982.
29 ! Fast Fourier Transform Algorithms for Vector Computers,
30 ! Parallel Computing, pages 45-63, 1984.
36 integer ( kind = 4 ) inc
37 integer ( kind = 4 ) lot
39 real ( kind = 8 ) dsum(*)
40 integer ( kind = 4 ) i
41 integer ( kind = 4 ) ier
42 integer ( kind = 4 ) ier1
43 integer ( kind = 4 ) jump
44 integer ( kind = 4 ) k
45 integer ( kind = 4 ) kc
46 integer ( kind = 4 ) lj
47 integer ( kind = 4 ) lnsv
48 integer ( kind = 4 ) lnwk
49 integer ( kind = 4 ) lnxh
50 integer ( kind = 4 ) m
51 integer ( kind = 4 ) m1
52 integer ( kind = 4 ) modn
53 integer ( kind = 4 ) n
54 integer ( kind = 4 ) np1
55 integer ( kind = 4 ) ns2
56 real ( kind = 4 ) sfnp1
57 real ( kind = 4 ) ssqrt3
60 real ( kind = 4 ) work(*)
61 real ( kind = 4 ) wsave(*)
62 real ( kind = 4 ) x(inc,*)
63 real ( kind = 4 ) xh(lot,*)
64 real ( kind = 4 ) xhold
67 lj = ( lot - 1 ) * jump + 1
74 ssqrt3 = 1.0E+00 / sqrt ( 3.0E+00 )
76 xhold = ssqrt3 * ( x(m,1) + x(m,2) )
77 x(m,2) = ssqrt3 * ( x(m,1) - x(m,2) )
91 t2 = wsave(k) * ( x(m,k) + x(m,kc) )
103 xh(m1,ns2+2) = 4.0E+00 * x(m,ns2+1)
111 lnxh = lot - 1 + lot * ( np1 - 1 ) + 1
112 lnsv = np1 + int ( log ( real ( np1, kind = 4 ) ) ) + 4
115 call rfftmf ( lot, 1, np1, lot, xh, lnxh, wsave(ns2+1), lnsv, work, &
118 if ( ier1 /= 0 ) then
120 call xerfft ( 'msntf1', -5 )
124 if ( mod ( np1, 2 ) == 0 ) then
126 xh(m,np1) = xh(m,np1) + xh(m,np1)
130 sfnp1 = 1.0E+00 / real ( np1, kind = 4 )
134 x(m,1) = 0.5E+00 * xh(m1,1)
142 x(m,i-1) = 0.5E+00 * xh(m1,i)
143 dsum(m1) = dsum(m1) + 0.5E+00 * xh(m1,i-1)
148 if ( modn /= 0 ) then
155 x(m,n) = 0.5E+00 * xh(m1,n+1)