LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ 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 36 of file lapacke_zhegvx.c.

44 {
45  lapack_int info = 0;
46  lapack_int lwork = -1;
47  lapack_int* iwork = NULL;
48  double* rwork = NULL;
49  lapack_complex_double* work = NULL;
50  lapack_complex_double work_query;
51  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
52  LAPACKE_xerbla( "LAPACKE_zhegvx", -1 );
53  return -1;
54  }
55 #ifndef LAPACK_DISABLE_NAN_CHECK
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_zge_nancheck( matrix_layout, n, 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 #endif
77  /* Allocate memory for working array(s) */
78  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
79  if( iwork == NULL ) {
81  goto exit_level_0;
82  }
83  rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,7*n) );
84  if( rwork == NULL ) {
86  goto exit_level_1;
87  }
88  /* Query optimal working array(s) size */
89  info = LAPACKE_zhegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
90  lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
91  ldz, &work_query, lwork, rwork, iwork, ifail );
92  if( info != 0 ) {
93  goto exit_level_2;
94  }
95  lwork = LAPACK_Z2INT( work_query );
96  /* Allocate memory for work arrays */
97  work = (lapack_complex_double*)
98  LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
99  if( work == NULL ) {
101  goto exit_level_2;
102  }
103  /* Call middle-level interface */
104  info = LAPACKE_zhegvx_work( matrix_layout, itype, jobz, range, uplo, n, a,
105  lda, b, ldb, vl, vu, il, iu, abstol, m, w, z,
106  ldz, work, lwork, rwork, iwork, ifail );
107  /* Release memory and exit */
108  LAPACKE_free( work );
109 exit_level_2:
110  LAPACKE_free( rwork );
111 exit_level_1:
112  LAPACKE_free( iwork );
113 exit_level_0:
114  if( info == LAPACK_WORK_MEMORY_ERROR ) {
115  LAPACKE_xerbla( "LAPACKE_zhegvx", info );
116  }
117  return info;
118 }
#define LAPACK_Z2INT(x)
Definition: lapacke.h:117
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)
lapack_logical LAPACKE_zhe_nancheck(int matrix_layout, char uplo, lapack_int n, const lapack_complex_double *a, lapack_int lda)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define lapack_complex_double
Definition: lapacke.h:90
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:36
#define LAPACK_COL_MAJOR
Definition: lapacke.h:120
void LAPACKE_xerbla(const char *name, lapack_int info)
#define lapack_int
Definition: lapacke.h:47
lapack_logical LAPACKE_zge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *a, lapack_int lda)
Here is the call graph for this function: