LAPACK  3.10.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zheevr()

lapack_int LAPACKE_zheevr ( 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 isuppz 
)

Definition at line 35 of file lapacke_zheevr.c.

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