LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_zhegvx()

lapack_int LAPACKE_zhegvx ( int  matrix_layout,
lapack_int  itype,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
lapack_complex_double b,
lapack_int  ldb,
double  vl,
double  vu,
lapack_int  il,
lapack_int  iu,
double  abstol,
lapack_int m,
double *  w,
lapack_complex_double z,
lapack_int  ldz,
lapack_int ifail 
)

Definition at line 35 of file lapacke_zhegvx.c.

43{
44 lapack_int info = 0;
45 lapack_int lwork = -1;
46 lapack_int* iwork = NULL;
47 double* rwork = NULL;
48 lapack_complex_double* work = NULL;
49 lapack_complex_double work_query;
50 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
51 LAPACKE_xerbla( "LAPACKE_zhegvx", -1 );
52 return -1;
53 }
54#ifndef LAPACK_DISABLE_NAN_CHECK
55 if( LAPACKE_get_nancheck() ) {
56 /* Optionally check input matrices for NaNs */
57 if( LAPACKE_zhe_nancheck( matrix_layout, uplo, n, a, lda ) ) {
58 return -7;
59 }
60 if( LAPACKE_d_nancheck( 1, &abstol, 1 ) ) {
61 return -15;
62 }
63 if( LAPACKE_zhe_nancheck( matrix_layout, uplo, n, b, ldb ) ) {
64 return -9;
65 }
66 if( LAPACKE_lsame( range, 'v' ) ) {
67 if( LAPACKE_d_nancheck( 1, &vl, 1 ) ) {
68 return -11;
69 }
70 }
71 if( LAPACKE_lsame( range, 'v' ) ) {
72 if( LAPACKE_d_nancheck( 1, &vu, 1 ) ) {
73 return -12;
74 }
75 }
76 }
77#endif
78 /* Allocate memory for working array(s) */
79 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
80 if( iwork == NULL ) {
82 goto exit_level_0;
83 }
84 rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,7*n) );
85 if( rwork == NULL ) {
87 goto exit_level_1;
88 }
89 /* Query optimal working array(s) size */
90 info = LAPACKE_zhegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
91 lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
92 ldz, &work_query, lwork, rwork, iwork, ifail );
93 if( info != 0 ) {
94 goto exit_level_2;
95 }
96 lwork = LAPACK_Z2INT( work_query );
97 /* Allocate memory for work arrays */
98 work = (lapack_complex_double*)
99 LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
100 if( work == NULL ) {
102 goto exit_level_2;
103 }
104 /* Call middle-level interface */
105 info = LAPACKE_zhegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
106 lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
107 ldz, work, lwork, rwork, iwork, ifail );
108 /* Release memory and exit */
109 LAPACKE_free( work );
110exit_level_2:
111 LAPACKE_free( rwork );
112exit_level_1:
113 LAPACKE_free( iwork );
114exit_level_0:
115 if( info == LAPACK_WORK_MEMORY_ERROR ) {
116 LAPACKE_xerbla( "LAPACKE_zhegvx", info );
117 }
118 return info;
119}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_double
Definition: lapack.h:64
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
lapack_int LAPACKE_zhegvx_work(int matrix_layout, lapack_int itype, char jobz, char range, char uplo, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double vl, double vu, lapack_int il, lapack_int iu, double abstol, lapack_int *m, double *w, lapack_complex_double *z, lapack_int ldz, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int *iwork, lapack_int *ifail)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
int LAPACKE_get_nancheck(void)
#define LAPACK_Z2INT(x)
Definition: lapacke.h:50
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
lapack_logical LAPACKE_zhe_nancheck(int matrix_layout, char uplo, lapack_int n, const lapack_complex_double *a, lapack_int lda)
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function: