LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zgeesx()

lapack_int LAPACKE_zgeesx ( int  matrix_layout,
char  jobvs,
char  sort,
LAPACK_Z_SELECT1  select,
char  sense,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
lapack_int sdim,
lapack_complex_double w,
lapack_complex_double vs,
lapack_int  ldvs,
double *  rconde,
double *  rcondv 
)

Definition at line 36 of file lapacke_zgeesx.c.

42 {
43  lapack_int info = 0;
44  lapack_int lwork = -1;
45  lapack_logical* bwork = NULL;
46  double* rwork = NULL;
47  lapack_complex_double* work = NULL;
48  lapack_complex_double work_query;
49  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
50  LAPACKE_xerbla( "LAPACKE_zgeesx", -1 );
51  return -1;
52  }
53 #ifndef LAPACK_DISABLE_NAN_CHECK
54  if( LAPACKE_get_nancheck() ) {
55  /* Optionally check input matrices for NaNs */
56  if( LAPACKE_zge_nancheck( matrix_layout, n, n, a, lda ) ) {
57  return -7;
58  }
59  }
60 #endif
61  /* Allocate memory for working array(s) */
62  if( LAPACKE_lsame( sort, 's' ) ) {
63  bwork = (lapack_logical*)
64  LAPACKE_malloc( sizeof(lapack_logical) * MAX(1,n) );
65  if( bwork == NULL ) {
67  goto exit_level_0;
68  }
69  }
70  rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,n) );
71  if( rwork == NULL ) {
73  goto exit_level_1;
74  }
75  /* Query optimal working array(s) size */
76  info = LAPACKE_zgeesx_work( matrix_layout, jobvs, sort, select, sense, n, a,
77  lda, sdim, w, vs, ldvs, rconde, rcondv,
78  &work_query, lwork, rwork, bwork );
79  if( info != 0 ) {
80  goto exit_level_2;
81  }
82  lwork = LAPACK_Z2INT( work_query );
83  /* Allocate memory for work arrays */
84  work = (lapack_complex_double*)
85  LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
86  if( work == NULL ) {
88  goto exit_level_2;
89  }
90  /* Call middle-level interface */
91  info = LAPACKE_zgeesx_work( matrix_layout, jobvs, sort, select, sense, n, a,
92  lda, sdim, w, vs, ldvs, rconde, rcondv, work,
93  lwork, rwork, bwork );
94  /* Release memory and exit */
95  LAPACKE_free( work );
96 exit_level_2:
97  LAPACKE_free( rwork );
98 exit_level_1:
99  if( LAPACKE_lsame( sort, 's' ) ) {
100  LAPACKE_free( bwork );
101  }
102 exit_level_0:
103  if( info == LAPACK_WORK_MEMORY_ERROR ) {
104  LAPACKE_xerbla( "LAPACKE_zgeesx", info );
105  }
106  return info;
107 }
#define lapack_logical
Definition: lapacke.h:51
#define LAPACK_Z2INT(x)
Definition: lapacke.h:117
lapack_int LAPACKE_zgeesx_work(int matrix_layout, char jobvs, char sort, LAPACK_Z_SELECT1 select, char sense, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_int *sdim, lapack_complex_double *w, lapack_complex_double *vs, lapack_int ldvs, double *rconde, double *rcondv, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_logical *bwork)
#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 MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
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
lapack_logical LAPACKE_zge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *a, lapack_int lda)
int LAPACKE_get_nancheck()
Here is the call graph for this function: