Developer Reference

  • 2020.2
  • 07/15/2020
  • Public Content
Contents

?feast_sbgv/?feast_hbgv

Extended Eigensolver interface for generalized eigenvalue problem with banded matrices.

Syntax

call sfeast_sbgv
(
uplo
,
n
,
kla
,
a
,
lda
,
klb
,
b
,
ldb
,
fpm
,
epsout
,
loop
,
emin
,
emax
,
m0
,
e
,
x
,
m
,
res
,
info
)
call dfeast_sbgv
(
uplo
,
n
,
kla
,
a
,
lda
,
klb
,
b
,
ldb
,
fpm
,
epsout
,
loop
,
emin
,
emax
,
m0
,
e
,
x
,
m
,
res
,
info
)
call cfeast_hbgv
(
uplo
,
n
,
kla
,
a
,
lda
,
klb
,
b
,
ldb
,
fpm
,
epsout
,
loop
,
emin
,
emax
,
m0
,
e
,
x
,
m
,
res
,
info
)
call zfeast_hbgv
(
uplo
,
n
,
kla
,
a
,
lda
,
klb
,
b
,
ldb
,
fpm
,
epsout
,
loop
,
emin
,
emax
,
m0
,
e
,
x
,
m
,
res
,
info
)
Include Files
  • mkl.fi
Description
The routines compute all the eigenvalues and eigenvectors for generalized eigenvalue problems,
Ax
=
λ
Bx
, within a given search interval.
Both matrices
A
and
B
must use the same family of storage format. The bandwidth, however, can be different (
klb
can be different from
kla
).
Input Parameters
uplo
CHARACTER*1
Must be
'U'
or
'L'
or
'F'
.
If
UPLO
=
'U'
,
a
and
b
store the upper triangular parts of
A
and
B
respectively.
If
UPLO
=
'L'
,
a
and
b
store the lower triangular parts of
A
and
B
respectively.
If
UPLO
=
'F'
,
a
and
b
store the full matrices
A
and
B
respectively.
n
INTEGER
Sets the size of the problem.
n
> 0.
kla
INTEGER
The number of super- or sub-diagonals within the band in
A
(
kla
0).
a
REAL
for
sfeast_sbgv
DOUBLE PRECISION
for
dfeast_sbgv
COMPLEX
for