LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zheevx()

lapack_int LAPACKE_zheevx ( int  matrix_layout,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
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_zheevx.c.

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