LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_zhbevx_2stage()

lapack_int LAPACKE_zhbevx_2stage ( int  matrix_layout,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_int  kd,
lapack_complex_double ab,
lapack_int  ldab,
lapack_complex_double q,
lapack_int  ldq,
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 35 of file lapacke_zhbevx_2stage.c.

43{
44 lapack_int info = 0;
45 lapack_int lwork = -1;
46 lapack_int* iwork = NULL;
47 double* rwork = NULL;
48 lapack_complex_double* work = NULL;
49 lapack_complex_double work_query;
50 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
51 LAPACKE_xerbla( "LAPACKE_zhbevx_2stage", -1 );
52 return -1;
53 }
54#ifndef LAPACK_DISABLE_NAN_CHECK
55 if( LAPACKE_get_nancheck() ) {
56 /* Optionally check input matrices for NaNs */
57 if( LAPACKE_zhb_nancheck( matrix_layout, uplo, n, kd, ab, ldab ) ) {
58 return -7;
59 }
60 if( LAPACKE_d_nancheck( 1, &abstol, 1 ) ) {
61 return -15;
62 }
63 if( LAPACKE_lsame( range, 'v' ) ) {
64 if( LAPACKE_d_nancheck( 1, &vl, 1 ) ) {
65 return -11;
66 }
67 }
68 if( LAPACKE_lsame( range, 'v' ) ) {
69 if( LAPACKE_d_nancheck( 1, &vu, 1 ) ) {
70 return -12;
71 }
72 }
73 }
74#endif
75 /* Query optimal working array(s) size */
76 info = LAPACKE_zhbevx_2stage_work( matrix_layout, jobz, range, uplo, n, kd, ab,
77 ldab, q, ldq, vl, vu, il, iu, abstol, m, w, z,
78 ldz, &work_query, lwork, rwork, iwork, ifail );
79 if( info != 0 ) {
80 goto exit_level_0;
81 }
82 lwork = LAPACK_Z2INT( work_query );
83 /* Allocate memory for working array(s) */
84 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
85 if( iwork == NULL ) {
87 goto exit_level_0;
88 }
89 rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,7*n) );
90 if( rwork == NULL ) {
92 goto exit_level_1;
93 }
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_zhbevx_2stage_work( matrix_layout, jobz, range, uplo, n, kd, ab,
102 ldab, q, ldq, vl, vu, il, iu, abstol, m, w, z,
103 ldz, work, lwork, rwork, iwork, ifail );
104 /* Release memory and exit */
105 LAPACKE_free( work );
106exit_level_2:
107 LAPACKE_free( rwork );
108exit_level_1:
109 LAPACKE_free( iwork );
110exit_level_0:
111 if( info == LAPACK_WORK_MEMORY_ERROR ) {
112 LAPACKE_xerbla( "LAPACKE_zhbevx_2stage", info );
113 }
114 return info;
115}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_double
Definition: lapack.h:64
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#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_int LAPACKE_zhbevx_2stage_work(int matrix_layout, char jobz, char range, char uplo, lapack_int n, lapack_int kd, lapack_complex_double *ab, lapack_int ldab, lapack_complex_double *q, lapack_int ldq, 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_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_logical LAPACKE_zhb_nancheck(int matrix_layout, char uplo, lapack_int n, lapack_int kd, const lapack_complex_double *ab, lapack_int ldab)
lapack_logical LAPACKE_d_nancheck(lapack_int n, const double *x, lapack_int incx)
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function: