sinqf - tion with only odd wave numbers. The SINQ operations are unnormalized inverses of themselves, so a call to SINQF followed by a call to SINQB will multiply the input sequence by 4 * N.
SUBROUTINE SINQF(N, X, WSAVE) INTEGER N REAL X(*), WSAVE(*) SUBROUTINE SINQF_64(N, X, WSAVE) INTEGER*8 N REAL X(*), WSAVE(*) F95 INTERFACE SUBROUTINE SINQF(N, X, WSAVE) INTEGER :: N REAL, DIMENSION(:) :: X, WSAVE SUBROUTINE SINQF_64(N, X, WSAVE) INTEGER(8) :: N REAL, DIMENSION(:) :: X, WSAVE C INTERFACE #include <sunperf.h> void sinqf(int n, float *x, float *wsave); void sinqf_64(long n, float *x, float *wsave);
Oracle Solaris Studio Performance Library sinqf(3P) NAME sinqf - compute the Fourier coefficients in a sine series representa- tion with only odd wave numbers. The SINQ operations are unnormalized inverses of themselves, so a call to SINQF followed by a call to SINQB will multiply the input sequence by 4 * N. SYNOPSIS SUBROUTINE SINQF(N, X, WSAVE) INTEGER N REAL X(*), WSAVE(*) SUBROUTINE SINQF_64(N, X, WSAVE) INTEGER*8 N REAL X(*), WSAVE(*) F95 INTERFACE SUBROUTINE SINQF(N, X, WSAVE) INTEGER :: N REAL, DIMENSION(:) :: X, WSAVE SUBROUTINE SINQF_64(N, X, WSAVE) INTEGER(8) :: N REAL, DIMENSION(:) :: X, WSAVE C INTERFACE #include <sunperf.h> void sinqf(int n, float *x, float *wsave); void sinqf_64(long n, float *x, float *wsave); ARGUMENTS N (input) Length of the sequence to be transformed. These subroutines are most efficient when N is a product of small primes. N >= 0. X (input/output) On entry, an array of length N containing the sequence to be transformed. On exit, the quarter-wave sine transform of the input. WSAVE (input) On entry, an array with dimension of at least (3 * N + 15) for scalar subroutines, initialized by SINQI. 7 Nov 2015 sinqf(3P)