Developer Reference for Intel® oneAPI Math Kernel Library for C

ID 766684
Date 12/16/2022
Public

A newer version of this document is available. Customers should click here to go to the newest version.

Document Table of Contents

mkl_cspblas_?csrgemv

Computes matrix - vector product of a sparse general matrix stored in the CSR format (3-array variation) with zero-based indexing (deprecated).

Syntax

void mkl_cspblas_scsrgemv (const char *transa , const MKL_INT *m , const float *a , const MKL_INT *ia , const MKL_INT *ja , const float *x , float *y );

void mkl_cspblas_dcsrgemv (const char *transa , const MKL_INT *m , const double *a , const MKL_INT *ia , const MKL_INT *ja , const double *x , double *y );

void mkl_cspblas_ccsrgemv (const char *transa , const MKL_INT *m , const MKL_Complex8 *a , const MKL_INT *ia , const MKL_INT *ja , const MKL_Complex8 *x , MKL_Complex8 *y );

void mkl_cspblas_zcsrgemv (const char *transa , const MKL_INT *m , const MKL_Complex16 *a , const MKL_INT *ia , const MKL_INT *ja , const MKL_Complex16 *x , MKL_Complex16 *y );

Include Files
  • mkl.h
Description

This routine is deprecated. Use mkl_sparse_?_mvfrom the Intel® oneAPI Math Kernel Library Inspector-executor Sparse BLAS interface instead.

The mkl_cspblas_?csrgemv routine performs a matrix-vector operation defined as

y := A*x

or

y := AT*x,

where:

x and y are vectors,

A is an m-by-m sparse square matrix in the CSR format (3-array variation) with zero-based indexing, AT is the transpose of A.

NOTE:

This routine supports only zero-based indexing of the input arrays.

Input Parameters

transa

Specifies the operation.

If transa = 'N' or 'n', then the matrix-vector product is computed as y := A*x

If transa = 'T' or 't' or 'C' or 'c', then the matrix-vector product is computed as y := AT*x,

m

Number of rows of the matrix A.

a

Array containing non-zero elements of the matrix A. Its length is equal to the number of non-zero elements in the matrix A. Refer to values array description in Sparse Matrix Storage Formats for more details.

ia

Array of length m + 1, containing indices of elements in the array a, such that ia[I] is the index in the array a of the first non-zero element from the row I. The value of the last element ia[m] is equal to the number of non-zeros. Refer to rowIndex array description in Sparse Matrix Storage Formats for more details.

ja

Array containing the column indices for each non-zero element of the matrix A.

Its length is equal to the length of the array a. Refer to columns array description in Sparse Matrix Storage Formats for more details.

x

Array, size is m.

One entry, the array x must contain the vector x.

Output Parameters
y

Array, size at least m.

On exit, the array y must contain the vector y.