Developer Reference

  • 098
  • 03/30/2020
  • Public Content
Contents

mkl_?csrmultcsr

Computes product of two sparse matrices stored in the CSR format (3-array variation) with one-based indexing (deprecated).

Syntax

call mkl_scsrmultcsr
(
trans
,
request
,
sort
,
m
,
n
,
k
,
a
,
ja
,
ia
,
b
,
jb
,
ib
,
c
,
jc
,
ic
,
nzmax
,
info
)
call mkl_dcsrmultcsr
(
trans
,
request
,
sort
,
m
,
n
,
k
,
a
,
ja
,
ia
,
b
,
jb
,
ib
,
c
,
jc
,
ic
,
nzmax
,
info
)
call mkl_ccsrmultcsr
(
trans
,
request
,
sort
,
m
,
n
,
k
,
a
,
ja
,
ia
,
b
,
jb
,
ib
,
c
,
jc
,
ic
,
nzmax
,
info
)
call mkl_zcsrmultcsr
(
trans
,
request
,
sort
,
m
,
n
,
k
,
a
,
ja
,
ia
,
b
,
jb
,
ib
,
c
,
jc
,
ic
,
nzmax
,
info
)
Include Files
  • mkl.fi
Description
This routine is deprecated. Use mkl_sparse_spmm from the
Intel® MKL
Inspector-executor Sparse BLAS interface instead.
The
mkl_?csrmultcsr
routine performs a matrix-matrix operation defined as
C
:= op(
A
)*
B
where:
A
,
B
,
C
are the sparse matrices in the CSR format (3-array variation);
op(
A
)
is one of
op(
A
) =
A
, or
op(
A
) =
A
T
, or
op(
A
) =
A
H
.
You can use the parameter
sort
to perform or not perform reordering of non-zero entries in input and output sparse matrices. The purpose of reordering is to rearrange non-zero entries in compressed sparse row matrix so that column indices in compressed sparse representation are sorted in the increasing order for each row.
The following table shows correspondence between the value of the parameter
sort
and the type of reordering performed by this routine for each sparse matrix involved: