Developer Reference

  • 0.10
  • 10/21/2020
  • Public Content
Contents

mkl_?diasv

Solves a system of linear equations for a sparse matrix in the diagonal format with one-based indexing (deprecated).

Syntax

void
mkl_sdiasv
(
const
char
*transa
,
const
MKL_INT
*m
,
const
float
*alpha
,
const
char
*matdescra
,
const
float
*val
,
const
MKL_INT
*lval
,
const
MKL_INT
*idiag
,
const
MKL_INT
*ndiag
,
const
float
*x
,
float
*y
);
void
mkl_ddiasv
(
const
char
*transa
,
const
MKL_INT
*m
,
const
double
*alpha
,
const
char
*matdescra
,
const
double
*val
,
const
MKL_INT
*lval
,
const
MKL_INT
*idiag
,
const
MKL_INT
*ndiag
,
const
double
*x
,
double
*y
);
void
mkl_cdiasv
(
const
char
*transa
,
const
MKL_INT
*m
,
const
MKL_Complex8
*alpha
,
const
char
*matdescra
,
const
MKL_Complex8
*val
,
const
MKL_INT
*lval
,
const
MKL_INT
*idiag
,
const
MKL_INT
*ndiag
,
const
MKL_Complex8
*x
,
MKL_Complex8
*y
);
void
mkl_zdiasv
(
const
char
*transa
,
const
MKL_INT
*m
,
const
MKL_Complex16
*alpha
,
const
char
*matdescra
,
const
MKL_Complex16
*val
,
const
MKL_INT
*lval
,
const
MKL_INT
*idiag
,
const
MKL_INT
*ndiag
,
const
MKL_Complex16
*x
,
MKL_Complex16
*y
);
Include Files
  • mkl.h
Description
This routine is deprecated. Use mkl_sparse_?_trsvfrom the
Intel® oneAPI Math Kernel Library
Inspector-executor Sparse BLAS interface instead.
The
mkl_?diasv
routine solves a system of linear equations with matrix-vector operations for a sparse matrix stored in the diagonal format:
y := alpha*inv(A)*x
or
y := alpha*inv(A
T
)* x,
where:
alpha
is scalar,
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 one-based indexing of the input arrays.
Input Parameters
transa
Specifies the system of linear equations.
If
transa
=
'N'
or
'n'
, then
y
:=
alpha
*inv(
A
)*
x
If
transa
=
'T'
or
't'
or
'C'
or
'c'
, then
y
:=
alpha
*inv(
A
T
)*
x
,
m
Number of rows of 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
Two-dimensional array of size
lval
by
ndiag
, contains non-zero diagonals of the matrix
A
. Refer to
values
array description in Diagonal Storage Scheme for more details.
lval
Leading dimension of
val
,
lval
m
. Refer to
lval
description in Diagonal Storage Scheme for more details.
idiag
Array of length
ndiag
, contains the distances between main diagonal and each non-zero diagonals in the matrix
A
.
All elements of this array must be sorted in increasing order.
Refer to
distance
array description in Diagonal Storage Scheme for more details.
ndiag
Specifies the number of non-zero diagonals of the matrix
A
.
x
Array, size at least
m
.
On entry, the array
x
must contain the vector
x
. The elements are accessed with unit increment.
y
Array, size at least
m
.
On entry, the array
y
must contain the vector
y
. The elements are accessed with unit increment.
Output Parameters
y
Contains solution vector
x
.

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