Intel® oneAPI Math Kernel Library Developer Reference - C
Computes matrix - vector product of a sparse symmetrical matrix stored in the CSR format (3-array variation) with one-based indexing (deprecated).
void mkl_scsrsymv (const char *uplo , const MKL_INT *m , const float *a , const MKL_INT *ia , const MKL_INT *ja , const float *x , float *y );
void mkl_dcsrsymv (const char *uplo , const MKL_INT *m , const double *a , const MKL_INT *ia , const MKL_INT *ja , const double *x , double *y );
void mkl_ccsrsymv (const char *uplo , 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_zcsrsymv (const char *uplo , const MKL_INT *m , const MKL_Complex16 *a , const MKL_INT *ia , const MKL_INT *ja , const MKL_Complex16 *x , MKL_Complex16 *y );
This routine is deprecated. Use mkl_sparse_?_mvfrom the Intel® oneAPI Math Kernel Library Inspector-executor Sparse BLAS interface instead.
The mkl_?csrsymv routine performs a matrix-vector operation defined as
y := A*x
where:
x and y are vectors,
A is an upper or lower triangle of the symmetrical sparse matrix in the CSR format (3-array variation).
This routine supports only one-based indexing of the input arrays.
Specifies whether the upper or low triangle of the matrix A is used.
If uplo = 'U' or 'u', then the upper triangle of the matrix A is used.
If uplo = 'L' or 'l', then the low triangle of the matrix A is used.
Number of rows of the matrix 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.
Array of length m + 1, containing indices of elements in the array a, such that ia[i] - ia[0] 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] - ia[0] is equal to the number of non-zeros. Refer to rowIndex array description in Sparse Matrix Storage Formats for more details.
Array containing the column indices plus one 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.
Array, size is m.
On entry, the array x must contain the vector x.
Array, size at least m.
On exit, the array y must contain the vector y.