vatchav - Vector complex haversine hav(x)

21.5 vatchav - Vector complex haversine $hav(x)$

#include <mvecatrig.h> 
 
void vatchav (int n, double complex *restrict y, int incy, 
              const double complex *restrict x, int incx); 
void vatchavf(int n, float complex *restrict y, int incy, 
              const float complex *restrict x, int incx); 
 
void vatchav_64 (long n, double complex *restrict y, long incy, 
                 const double compex *restrict x, long incx); 
void vatchavf_64(long n, float complex *restrict y, long incy, 
                 const float complex *restrict x, long incx);

Given an input vector $x$ and a result vector $y$ , this function computes:

(1 ) y= hav(x)= sin2 - x 2

21.5.1 Parameters

N - INTEGER: ENTRY: Number of elements of $x$ and $y$ .
CONSTRAINT: $n ≥1$ .
Y - ARRAY OF COMPLEX: EXIT: Result vector $y$ .
CONSTRAINT: Must contain $n× incy$ elements.
CONSTRAINT: Must not overlap with array $x$ .
INCY - INTEGER: ENTRY: Stride for the vector $y$ .
CONSTRAINT: $incy̸= 0$ .
BEHAVIOR: A negative stride will traverse the array in reverse.
X - ARRAY OF COMPLEX: ENTRY: Input vector $x$ .
CONSTRAINT: Must contain $n× incx$ elements.
CONSTRAINT: Must not overlap with array $y$ .
INCX - INTEGER: ENTRY: Stride for the vector $x$ .
CONSTRAINT: $incx̸= 0$ .
BEHAVIOR: A negative stride will traverse the array in reverse.

21.5.2 Function Graphs

[next] [prev] [prev-tail] [front] [up]