LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dgeev_work()

lapack_int LAPACKE_dgeev_work ( int  matrix_layout,
char  jobvl,
char  jobvr,
lapack_int  n,
double *  a,
lapack_int  lda,
double *  wr,
double *  wi,
double *  vl,
lapack_int  ldvl,
double *  vr,
lapack_int  ldvr,
double *  work,
lapack_int  lwork 
)

Definition at line 36 of file lapacke_dgeev_work.c.

41 {
42  lapack_int info = 0;
43  if( matrix_layout == LAPACK_COL_MAJOR ) {
44  /* Call LAPACK function and adjust info */
45  LAPACK_dgeev( &jobvl, &jobvr, &n, a, &lda, wr, wi, vl, &ldvl, vr, &ldvr,
46  work, &lwork, &info );
47  if( info < 0 ) {
48  info = info - 1;
49  }
50  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
51  lapack_int lda_t = MAX(1,n);
52  lapack_int ldvl_t = MAX(1,n);
53  lapack_int ldvr_t = MAX(1,n);
54  double* a_t = NULL;
55  double* vl_t = NULL;
56  double* vr_t = NULL;
57  /* Check leading dimension(s) */
58  if( lda < n ) {
59  info = -6;
60  LAPACKE_xerbla( "LAPACKE_dgeev_work", info );
61  return info;
62  }
63  if( ldvl < n ) {
64  info = -10;
65  LAPACKE_xerbla( "LAPACKE_dgeev_work", info );
66  return info;
67  }
68  if( ldvr < n ) {
69  info = -12;
70  LAPACKE_xerbla( "LAPACKE_dgeev_work", info );
71  return info;
72  }
73  /* Query optimal working array(s) size if requested */
74  if( lwork == -1 ) {
75  LAPACK_dgeev( &jobvl, &jobvr, &n, a, &lda_t, wr, wi, vl, &ldvl_t,
76  vr, &ldvr_t, work, &lwork, &info );
77  return (info < 0) ? (info - 1) : info;
78  }
79  /* Allocate memory for temporary array(s) */
80  a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
81  if( a_t == NULL ) {
83  goto exit_level_0;
84  }
85  if( LAPACKE_lsame( jobvl, 'v' ) ) {
86  vl_t = (double*)
87  LAPACKE_malloc( sizeof(double) * ldvl_t * MAX(1,n) );
88  if( vl_t == NULL ) {
90  goto exit_level_1;
91  }
92  }
93  if( LAPACKE_lsame( jobvr, 'v' ) ) {
94  vr_t = (double*)
95  LAPACKE_malloc( sizeof(double) * ldvr_t * MAX(1,n) );
96  if( vr_t == NULL ) {
98  goto exit_level_2;
99  }
100  }
101  /* Transpose input matrices */
102  LAPACKE_dge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
103  /* Call LAPACK function and adjust info */
104  LAPACK_dgeev( &jobvl, &jobvr, &n, a_t, &lda_t, wr, wi, vl_t, &ldvl_t,
105  vr_t, &ldvr_t, work, &lwork, &info );
106  if( info < 0 ) {
107  info = info - 1;
108  }
109  /* Transpose output matrices */
110  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
111  if( LAPACKE_lsame( jobvl, 'v' ) ) {
112  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, vl_t, ldvl_t, vl, ldvl );
113  }
114  if( LAPACKE_lsame( jobvr, 'v' ) ) {
115  LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, vr_t, ldvr_t, vr, ldvr );
116  }
117  /* Release memory and exit */
118  if( LAPACKE_lsame( jobvr, 'v' ) ) {
119  LAPACKE_free( vr_t );
120  }
121 exit_level_2:
122  if( LAPACKE_lsame( jobvl, 'v' ) ) {
123  LAPACKE_free( vl_t );
124  }
125 exit_level_1:
126  LAPACKE_free( a_t );
127 exit_level_0:
128  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
129  LAPACKE_xerbla( "LAPACKE_dgeev_work", info );
130  }
131  } else {
132  info = -1;
133  LAPACKE_xerbla( "LAPACKE_dgeev_work", info );
134  }
135  return info;
136 }
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACKE_free(p)
Definition: lapacke.h:113
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
void LAPACK_dgeev(char *jobvl, char *jobvr, lapack_int *n, double *a, lapack_int *lda, double *wr, double *wi, double *vl, lapack_int *ldvl, double *vr, lapack_int *ldvr, double *work, lapack_int *lwork, lapack_int *info)
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
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
Here is the call graph for this function:
Here is the caller graph for this function: