NAME

SYNOPSIS

  SUBROUTINE VSINQI( N, WSAVE)
  INTEGER N
  REAL WSAVE(*)
 
  SUBROUTINE VSINQI_64( N, WSAVE)
  INTEGER*8 N
  REAL WSAVE(*)
 

F95 INTERFACE

  SUBROUTINE VSINQI( N, WSAVE)
  INTEGER :: N
  REAL, DIMENSION(:) :: WSAVE
 
  SUBROUTINE VSINQI_64( N, WSAVE)
  INTEGER(8) :: N
  REAL, DIMENSION(:) :: WSAVE
 

C INTERFACE

void vsinqi(int n, float *wsave);

void vsinqi_64(long n, float *wsave);

ARGUMENTS

* N (input)

Length of the sequence to be transformed. The method is most efficient when N is a product of small primes.

* WSAVE (input)

On entry, an array with a dimension of at least (2 * N + 15). The same work array can be used for both VSINQF and VSINQB as long as N remains unchanged. Different WSAVE arrays are required for different values of N. This initialization does not have to be repeated between calls to VSINQF or VSINQB as long as N and WSAVE remain unchanged, thus subsequent transforms can be obtained faster than the first.