1 subroutine d1f2kf ( ido, l1, cc, in1, ch, in2, wa1 )
3 !*****************************************************************************80
5 !! D1F2KF is an FFTPACK5 auxiliary routine.
15 ! Original real single precision by Paul Swarztrauber, Richard Valent.
16 ! Real 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 ) ch(in2,ido,2,l1)
40 real ( kind = 8 ) cc(in1,ido,l1,2)
41 integer ( kind = 4 ) i
42 integer ( kind = 4 ) ic
43 integer ( kind = 4 ) idp2
44 integer ( kind = 4 ) k
45 real ( kind = 8 ) wa1(ido)
48 ch(1,1,1,k) = cc(1,1,k,1) + cc(1,1,k,2)
49 ch(1,ido,2,k) = cc(1,1,k,1) - cc(1,1,k,2)
63 ch(1,i,1,k) = cc(1,i,k,1) + ( wa1(i-2) * cc(1,i,k,2) &
64 - wa1(i-1) * cc(1,i-1,k,2) )
65 ch(1,ic,2,k) = -cc(1,i,k,1) + ( wa1(i-2) * cc(1,i,k,2) &
66 - wa1(i-1) * cc(1,i-1,k,2) )
67 ch(1,i-1,1,k) = cc(1,i-1,k,1) + ( wa1(i-2) * cc(1,i-1,k,2) &
68 + wa1(i-1) * cc(1,i,k,2))
69 ch(1,ic-1,2,k) = cc(1,i-1,k,1) - ( wa1(i-2) * cc(1,i-1,k,2) &
70 + wa1(i-1) * cc(1,i,k,2))
74 if ( mod ( ido, 2 ) == 1 ) then
81 ch(1,1,2,k) = -cc(1,ido,k,2)
82 ch(1,ido,1,k) = cc(1,ido,k,1)