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

◆ LAPACKE_cheevx()

lapack_int LAPACKE_cheevx ( int  matrix_layout,
char  jobz,
char  range,
char  uplo,
lapack_int  n,
lapack_complex_float a,
lapack_int  lda,
float  vl,
float  vu,
lapack_int  il,
lapack_int  iu,
float  abstol,
lapack_int m,
float *  w,
lapack_complex_float z,
lapack_int  ldz,
lapack_int ifail 
)

Definition at line 35 of file lapacke_cheevx.c.

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