1 subroutine zmf2kb ( lot, ido, l1, na, cc, im1, in1, ch, im2, in2, wa )
3 !*****************************************************************************80
5 !! ZMF2KB is an FFTPACK5 auxiliary routine.
15 ! Original complex single precision by Paul Swarztrauber, Richard Valent.
16 ! Complex double precision version by John Burkardt.
21 ! Vectorizing the Fast Fourier Transforms,
22 ! in Parallel Computations,
23 ! edited by G. Rodrigue,
24 ! Academic Press, 1982.
27 ! Fast Fourier Transform Algorithms for Vector Computers,
28 ! Parallel Computing, pages 45-63, 1984.
34 integer ( kind = 4 ) ido
35 integer ( kind = 4 ) in1
36 integer ( kind = 4 ) in2
37 integer ( kind = 4 ) l1
39 real ( kind = 8 ) cc(2,in1,l1,ido,2)
40 real ( kind = 8 ) ch(2,in2,l1,2,ido)
41 real ( kind = 8 ) chold1
42 real ( kind = 8 ) chold2
43 integer ( kind = 4 ) i
44 integer ( kind = 4 ) im1
45 integer ( kind = 4 ) im2
46 integer ( kind = 4 ) k
47 integer ( kind = 4 ) lot
48 integer ( kind = 4 ) m1
49 integer ( kind = 4 ) m1d
50 integer ( kind = 4 ) m2
51 integer ( kind = 4 ) m2s
52 integer ( kind = 4 ) na
55 real ( kind = 8 ) wa(ido,1,2)
57 m1d = ( lot - 1 ) * im1 + 1
60 if ( 1 < ido .or. na == 1 ) then
66 ch(1,m2,k,1,1) = cc(1,m1,k,1,1) + cc(1,m1,k,1,2)
67 ch(1,m2,k,2,1) = cc(1,m1,k,1,1) - cc(1,m1,k,1,2)
68 ch(2,m2,k,1,1) = cc(2,m1,k,1,1) + cc(2,m1,k,1,2)
69 ch(2,m2,k,2,1) = cc(2,m1,k,1,1) - cc(2,m1,k,1,2)
78 ch(1,m2,k,1,i) = cc(1,m1,k,i,1)+cc(1,m1,k,i,2)
79 tr2 = cc(1,m1,k,i,1)-cc(1,m1,k,i,2)
80 ch(2,m2,k,1,i) = cc(2,m1,k,i,1)+cc(2,m1,k,i,2)
81 ti2 = cc(2,m1,k,i,1)-cc(2,m1,k,i,2)
83 ch(2,m2,k,2,i) = wa(i,1,1) * ti2 + wa(i,1,2) * tr2
84 ch(1,m2,k,2,i) = wa(i,1,1) * tr2 - wa(i,1,2) * ti2
95 chold1 = cc(1,m1,k,1,1) + cc(1,m1,k,1,2)
96 cc(1,m1,k,1,2) = cc(1,m1,k,1,1) - cc(1,m1,k,1,2)
97 cc(1,m1,k,1,1) = chold1
99 chold2 = cc(2,m1,k,1,1) + cc(2,m1,k,1,2)
100 cc(2,m1,k,1,2) = cc(2,m1,k,1,1) - cc(2,m1,k,1,2)
101 cc(2,m1,k,1,1) = chold2