mkl_cspblas_?csrtrsv
mkl_cspblas_?csrtrsv
Triangular solvers with simplified interface for a sparse matrix in the CSR format (3-array variation) with zero-based indexing (deprecated).
Syntax
void
mkl_cspblas_scsrtrsv
(
const
char
*uplo
,
const
char
*transa
,
const
char
*diag
,
const
MKL_INT
*m
,
const
float
*a
,
const
MKL_INT
*ia
,
const
MKL_INT
*ja
,
const
float
*x
,
float
*y
);
void
mkl_cspblas_dcsrtrsv
(
const
char
*uplo
,
const
char
*transa
,
const
char
*diag
,
const
MKL_INT
*m
,
const
double
*a
,
const
MKL_INT
*ia
,
const
MKL_INT
*ja
,
const
double
*x
,
double
*y
);
void
mkl_cspblas_ccsrtrsv
(
const
char
*uplo
,
const
char
*transa
,
const
char
*diag
,
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_zcsrtrsv
(
const
char
*uplo
,
const
char
*transa
,
const
char
*diag
,
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_?_trsvfrom the Inspector-executor Sparse BLAS interface instead.
Intel® oneAPI Math Kernel Library
The
mkl_cspblas_?csrtrsv
routine solves a system of linear equations with matrix-vector operations for a sparse matrix stored in the CSR format (3-array variation) with zero-based indexing: A*y = x
or
AT*y = x,
where:
x
and y
are vectors, A
is a sparse upper or lower triangular matrix with unit or non-unit main diagonal, A
T
is the transpose of A
.This routine supports only zero-based indexing of the input arrays.
Input Parameters
- uplo
- Specifies whether the upper or low triangle of the matrixAis used.Iforuplo='U''u', then the upper triangle of the matrixAis used.Iforuplo='L''l', then the low triangle of the matrixAis used.
- transa
- Specifies the system of linear equations.Ifortransa='N''n', thenA*y=xIfortransa='T''t'or'C'or'c', then,AT*y=x
- diag
- Specifies whether matrixAis unit triangular.Ifordiag='U''u', thenAis unit triangular.Ifordiag='N''n', thenAis not unit triangular.
- m
- Number of rows of the matrixA.
- a
- Array containing non-zero elements of the matrixA. Its length is equal to the number of non-zero elements in the matrixA. Refer tovaluesarray description in Sparse Matrix Storage Formats for more details.The non-zero elements of the given row of the matrix must be stored in the same order as they appear in the row (from left to right).No diagonal element can be omitted from a sparse storage if the solver is called with the non-unit indicator.
- ia
- Array of length, containing indices of elements in the arraym+1a, such thatis the index in the arrayia[i]aof the first non-zero element from the rowi. The value of the last elementis equal to the number of non-zeros. Refer toia[m]rowIndexarray description in Sparse Matrix Storage Formats for more details.
- ja
- Array containing the column indices for each non-zero element of the matrixA.Its length is equal to the length of the arraya. Refer tocolumnsarray description in Sparse Matrix Storage Formats for more details.Column indices must be sorted in increasing order for each row.
- x
- Array, size ism.On entry, the arrayxmust contain the vectorx.
Output Parameters
- y
- Array, size at leastm.Contains the vectory.