Version: 0.9
Last Updated: 09/09/2020
Public Content

Contents

mkl_?bsrmm

Computes matrix - matrix product of a sparse matrix stored in the BSR format (deprecated).

Syntax

void

mkl_sbsrmm

(

const

char

*transa

const

MKL_INT

const

MKL_INT

const

MKL_INT

const

MKL_INT

*lb

const

float

*alpha

const

char

*matdescra

const

float

*val

const

MKL_INT

*indx

const

MKL_INT

*pntrb

const

MKL_INT

*pntre

const

float

const

MKL_INT

*ldb

const

float

*beta

float

const

MKL_INT

*ldc

);

void

mkl_dbsrmm

(

const

char

*transa

const

MKL_INT

const

MKL_INT

const

MKL_INT

const

MKL_INT

*lb

const

double

*alpha

const

char

*matdescra

const

double

*val

const

MKL_INT

*indx

const

MKL_INT

*pntrb

const

MKL_INT

*pntre

const

double

const

MKL_INT

*ldb

const

double

*beta

double

const

MKL_INT

*ldc

);

void

mkl_cbsrmm

(

const

char

*transa

const

MKL_INT

const

MKL_INT

const

MKL_INT

const

MKL_INT

*lb

const

MKL_Complex8

*alpha

const

char

*matdescra

const

MKL_Complex8

*val

const

MKL_INT

*indx

const

MKL_INT

*pntrb

const

MKL_INT

*pntre

const

MKL_Complex8

const

MKL_INT

*ldb

const

MKL_Complex8

*beta

MKL_Complex8

const

MKL_INT

*ldc

);

void

mkl_zbsrmm

(

const

char

*transa

const

MKL_INT

const

MKL_INT

const

MKL_INT

const

MKL_INT

*lb

const

MKL_Complex16

*alpha

const

char

*matdescra

const

MKL_Complex16

*val

const

MKL_INT

*indx

const

MKL_INT

*pntrb

const

MKL_INT

*pntre

const

MKL_Complex16

const

MKL_INT

*ldb

const

MKL_Complex16

*beta

MKL_Complex16

const

MKL_INT

*ldc

);

Include Files

mkl.h

Description

This routine is deprecated. Use Use mkl_sparse_?_mmfrom the

Intel® oneAPI Math Kernel Library

Inspector-executor Sparse BLAS interface instead.

The

mkl_?bsrmm

routine performs a matrix-matrix operation defined as

C := alpha*A*B + beta*C

C := alpha*A^T*B + beta*C

C := alpha*A^H*B + beta*C,

where:

alpha and beta are scalars,

B and C are dense matrices, A is an m-by-k sparse matrix in block sparse row (BSR) format, A^T is the transpose of A, and A^H is the conjugate transpose of A.

This routine supports a BSR format both with one-based indexing and zero-based indexing.

Input Parameters

transa: Specifies the operation.
If
transa
= 'N'
or 'n', then the matrix-matrix product is computed as
C := alpha*A*B + beta*C
If
transa
= 'T'
or 't', then the matrix-vector product is computed as
C := alpha*A^T*B + beta*C
If
transa
=
'C' or 'c', then the matrix-vector product is computed as
C := alpha*A^H*B + beta*C
,
m: Number of block rows of the matrix A.
n: Number of columns of the matrix C.
k: Number of block columns of the matrix A.
lb: Size of the block in the matrix A.
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 elements of non-zero blocks of the matrix A. Its length is equal to the number of non-zero blocks in the matrix A multiplied by
lb
*
lb
. Refer to the
values
array description in BSR Format for more details.
indx: For one-based indexing, array containing the column indices plus one for each non-zero block in the matrix A.
For zero-based indexing, array containing the column indices for each non-zero block in the matrix A.
Its length is equal to the number of non-zero blocks in the matrix A. Refer to the
columns
array description in BSR Format for more details.
pntrb: Array of length
m
.
This array contains row indices, such that
pntrb
[I] -
pntrb
[0]
is the first index of block row I in the array
indx
.
Refer to
pointerB
array description in BSR Format for more details.
pntre: Array of length
m
.
This array contains row indices, such that
pntre
[I] -
pntrb
[0] - 1
is the last index of block row I in the array
indx
.
Refer to
pointerE
array description in BSR Format for more details.
b: Array, size
ldb
by at least
n
for non-transposed matrix A and at least
m
for transposed for one-based indexing, and (at least
k
for non-transposed matrix A and at least
m
for transposed,
ldb
) for zero-based indexing.
On entry with
transa=
'N'
or 'n', the leading
n
-by-
k
block part of the array
b
must contain the matrix B, otherwise the leading
m
-by-
n
block part of the array
b
must contain the matrix B.
ldb: Specifies the leading dimension (in blocks) of
b
as declared in the calling (sub)program.
beta: Specifies the scalar beta.
c: Array, size
ldc* n
for one-based indexing, size
k* ldc
for zero-based indexing.
On entry, the leading
m
-by-
n
block part of the array
c
must contain the matrix C, otherwise the leading
n
-by- block part of the array
c
must contain the matrix C.
ldc: Specifies the leading dimension (in blocks) of
c
as declared in the calling (sub)program.

Output Parameters

c: Overwritten by the matrix
(alpha*A*B + beta*C)
or
(alpha*A^T*B + beta*C)
or
(alpha*A^H*B + beta*C)
.

In This Topic

Product and Performance Information

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

Quick Links

Recent Searches

mkl_?bsrmm

Syntax

Product and Performance Information

Sign In

mkl_?bsrmm

Syntax

Product and Performance Information