LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zheevr_2stage()

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