Contents

# mkl_?csrsm

Solves a system of linear matrix equations for a sparse matrix in the CSR format (deprecated).

## Syntax

Include Files
• mkl.h
Description
This routine is deprecated. Use mkl_sparse_?_trsmfrom the
Intel® MKL
The
mkl_?csrsm
routine solves a system of linear equations with matrix-matrix operations for a sparse matrix in the CSR format:
C
:=
alpha
*inv(
A
)*
B
or
C
:=
alpha
*inv(
A
T
)*
B
,
where:
alpha
is scalar,
B
and
C
are dense matrices,
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 a CSR format both with one-based indexing and zero-based indexing.
Input Parameters
transa
Specifies the system of linear equations.
If
transa
=
'N'
or
'n'
, then
C
:=
alpha
*inv(
A
)*
B
If
transa
=
'T'
or
't'
or
'C'
or
'c'
, then
C
:=
alpha
*inv(
A
T
)*
B
,
m
Number of columns of the matrix
A
.
n
Number of columns of the matrix
C
.
alpha
Specifies the scalar
alpha
.
matdescra
Array of six elements, specifies properties of the matrix used for operation. Only first four array elements are used, their possible values are given in
Table “Possible Values of the Parameter
matdescra
(
descra
)”
. Possible combinations of element values of this parameter are given in
Table “Possible Combinations of Element Values of the Parameter
matdescra
.
val
Array containing non-zero elements of the matrix
A
.
For zero-based indexing its length is
pntre
[
m
—1] -
pntrb
[0]
.
Refer to
values
array description in CSR Format 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.
indx
For one-based indexing, array containing the column indices plus one for each non-zero element of the matrix
A
.
For zero-based indexing, array containing the column indices for each non-zero element of the matrix
A
.
Its length is equal to length of the
val
array.
Refer to
columns
array description in CSR Format for more details.
Column indices must be sorted in increasing order for each row.
pntrb
Array of length
m
.
This array contains row indices, such that
pntrb
[
i
] -
pntrb
[0]
is the first index of row
i
in the arrays
val
and
indx
.
Refer to
pointerb
array description in CSR Format for more details.
pntre
Array of length
m
.
For zero-based indexing this array contains row indices, such that
pntre
[
i
] -
pntrb
[0] - 1
is the last index of row
i
in the arrays
val
and
indx
.
Refer to
pointerE
array description in CSR Format for more details.
b
Array, size
ldb
*
n
for one-based indexing, and
(
m
,
ldb
)
for zero-based indexing.
m
-by-
n
part of the array
b
must contain the matrix
B
.
ldb
b
for one-based indexing, and the second dimension of
b
for zero-based indexing, as declared in the calling (sub)program.
ldc
c
for one-based indexing, and the second dimension of
c
for zero-based indexing, as declared in the calling (sub)program.
Output Parameters
c
Array, size
ldc
by
n
for one-based indexing, and
(
m
,
ldc
)
for zero-based indexing.
m
-by-
n
part of the array
c
contains the output matrix
C
.

#### Product and Performance Information

1

Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804