?gthrz

Gathers a sparse vector's elements into compressed form, replacing them by zeros.

Syntax

FORTRAN 77:

call sgthrz(nz, y, x, indx )

call dgthrz(nz, y, x, indx )

call cgthrz(nz, y, x, indx )

call zgthrz(nz, y, x, indx )

Fortran 95:

res = gthrz(x, indx, y)

C:

void cblas_sgthrz (const MKL_INT nz, float *y, float *x, const MKL_INT *indx);

void cblas_dgthrz (const MKL_INT nz, double *y, double *x, const MKL_INT *indx);

void cblas_cgthrz (const MKL_INT nz, void *y, void *x, const MKL_INT *indx);

void cblas_zgthrz (const MKL_INT nz, void *y, void *x, const MKL_INT *indx);

Include Files

  • Fortran: mkl.fi
  • Fortran 95: blas.f90
  • C: mkl.h

Description

The ?gthrz routines gather the elements with indices specified by the array indx from a full-storage vector y into compressed form (nz, x, indx) and overwrite the gathered elements of y by zeros. Other elements of y are not referenced or modified (see also ?gthr).

Input Parameters

nz

INTEGER. The number of elements of y to be gathered.

indx

INTEGER. Specifies indices of elements to be gathered.

Array, size at least nz.

y

REAL for sgthrz

DOUBLE PRECISION for dgthrz

COMPLEX for cgthrz

DOUBLE COMPLEX for zgthrz

Array, size at least max(indx(i)).

Output Parameters

x

REAL for sgthrz

DOUBLE PRECISION for d gthrz

COMPLEX for cgthrz

DOUBLE COMPLEX for zgthrz

Array, size at least nz.

Contains the vector converted to the compressed form.

y

The updated vector y.

Fortran 95 Interface Notes

Routines in Fortran 95 interface have fewer arguments in the calling sequence than their FORTRAN 77 counterparts. For general conventions applied to skip redundant or reconstructible arguments, see Fortran 95 Interface Conventions.

Specific details for the routine gthrz interface are the following:

x

Holds the vector with the number of elements nz.

indx

Holds the vector with the number of elements nz.

y

Holds the vector with the number of elements nz.

Para obtener más información sobre las optimizaciones del compilador, consulte el aviso sobre la optimización.