LAPACK  3.7.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 36 of file lapacke_zheevr.c.

42 {
43  lapack_int info = 0;
44  lapack_int liwork = -1;
45  lapack_int lrwork = -1;
46  lapack_int lwork = -1;
47  lapack_int* iwork = NULL;
48  double* rwork = NULL;
49  lapack_complex_double* work = NULL;
50  lapack_int iwork_query;
51  double rwork_query;
52  lapack_complex_double work_query;
53  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
54  LAPACKE_xerbla( "LAPACKE_zheevr", -1 );
55  return -1;
56  }
57 #ifndef LAPACK_DISABLE_NAN_CHECK
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 #endif
76  /* Query optimal working array(s) size */
77  info = LAPACKE_zheevr_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
78  vu, il, iu, abstol, m, w, z, ldz, isuppz,
79  &work_query, lwork, &rwork_query, lrwork,
80  &iwork_query, liwork );
81  if( info != 0 ) {
82  goto exit_level_0;
83  }
84  liwork = (lapack_int)iwork_query;
85  lrwork = (lapack_int)rwork_query;
86  lwork = LAPACK_Z2INT( work_query );
87  /* Allocate memory for work arrays */
88  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * liwork );
89  if( iwork == NULL ) {
91  goto exit_level_0;
92  }
93  rwork = (double*)LAPACKE_malloc( sizeof(double) * lrwork );
94  if( rwork == NULL ) {
96  goto exit_level_1;
97  }
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_zheevr_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
106  vu, il, iu, abstol, m, w, z, ldz, isuppz, work,
107  lwork, rwork, lrwork, iwork, liwork );
108  /* Release memory and exit */
109  LAPACKE_free( work );
110 exit_level_2:
111  LAPACKE_free( rwork );
112 exit_level_1:
113  LAPACKE_free( iwork );
114 exit_level_0:
115  if( info == LAPACK_WORK_MEMORY_ERROR ) {
116  LAPACKE_xerbla( "LAPACKE_zheevr", info );
117  }
118  return info;
119 }
#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 LAPACKE_malloc(size)
Definition: lapacke.h:110
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
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)
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
Here is the call graph for this function: