LAPACK  3.9.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zggev3_work()

lapack_int LAPACKE_zggev3_work ( int  matrix_layout,
char  jobvl,
char  jobvr,
lapack_int  n,
lapack_complex_double *  a,
lapack_int  lda,
lapack_complex_double *  b,
lapack_int  ldb,
lapack_complex_double *  alpha,
lapack_complex_double *  beta,
lapack_complex_double *  vl,
lapack_int  ldvl,
lapack_complex_double *  vr,
lapack_int  ldvr,
lapack_complex_double *  work,
lapack_int  lwork,
double *  rwork 
)

Definition at line 35 of file lapacke_zggev3_work.c.

45 {
46  lapack_int info = 0;
47  if( matrix_layout == LAPACK_COL_MAJOR ) {
48  /* Call LAPACK function and adjust info */
49  LAPACK_zggev3( &jobvl, &jobvr, &n, a, &lda, b, &ldb, alpha, beta, vl,
50  &ldvl, vr, &ldvr, work, &lwork, rwork, &info );
51  if( info < 0 ) {
52  info = info - 1;
53  }
54  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
55  lapack_int nrows_vl = LAPACKE_lsame( jobvl, 'v' ) ? n : 1;
56  lapack_int ncols_vl = LAPACKE_lsame( jobvl, 'v' ) ? n : 1;
57  lapack_int nrows_vr = LAPACKE_lsame( jobvr, 'v' ) ? n : 1;
58  lapack_int ncols_vr = LAPACKE_lsame( jobvr, 'v' ) ? n : 1;
59  lapack_int lda_t = MAX(1,n);
60  lapack_int ldb_t = MAX(1,n);
61  lapack_int ldvl_t = MAX(1,nrows_vl);
62  lapack_int ldvr_t = MAX(1,nrows_vr);
63  lapack_complex_double* a_t = NULL;
64  lapack_complex_double* b_t = NULL;
65  lapack_complex_double* vl_t = NULL;
66  lapack_complex_double* vr_t = NULL;
67  /* Check leading dimension(s) */
68  if( lda < n ) {
69  info = -6;
70  LAPACKE_xerbla( "LAPACKE_zggev3_work", info );
71  return info;
72  }
73  if( ldb < n ) {
74  info = -8;
75  LAPACKE_xerbla( "LAPACKE_zggev3_work", info );
76  return info;
77  }
78  if( ldvl < ncols_vl ) {
79  info = -12;
80  LAPACKE_xerbla( "LAPACKE_zggev3_work", info );
81  return info;
82  }
83  if( ldvr < ncols_vr ) {
84  info = -14;
85  LAPACKE_xerbla( "LAPACKE_zggev3_work", info );
86  return info;
87  }
88  /* Query optimal working array(s) size if requested */
89  if( lwork == -1 ) {
90  LAPACK_zggev3( &jobvl, &jobvr, &n, a, &lda_t, b, &ldb_t,
91  alpha, beta, vl, &ldvl_t, vr, &ldvr_t,
92  work, &lwork, rwork, &info );
93  return (info < 0) ? (info - 1) : info;
94  }
95  /* Allocate memory for temporary array(s) */
96  a_t = (lapack_complex_double*)
97  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
98  if( a_t == NULL ) {
99  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
100  goto exit_level_0;
101  }
102  b_t = (lapack_complex_double*)
103  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
104  if( b_t == NULL ) {
105  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
106  goto exit_level_1;
107  }
108  if( LAPACKE_lsame( jobvl, 'v' ) ) {
109  vl_t = (lapack_complex_double*)
110  LAPACKE_malloc( sizeof(lapack_complex_double) *
111  ldvl_t * MAX(1,ncols_vl) );
112  if( vl_t == NULL ) {
113  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
114  goto exit_level_2;
115  }
116  }
117  if( LAPACKE_lsame( jobvr, 'v' ) ) {
118  vr_t = (lapack_complex_double*)
119  LAPACKE_malloc( sizeof(lapack_complex_double) *
120  ldvr_t * MAX(1,ncols_vr) );
121  if( vr_t == NULL ) {
122  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
123  goto exit_level_3;
124  }
125  }
126  /* Transpose input matrices */
127  LAPACKE_zge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
128  LAPACKE_zge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
129  /* Call LAPACK function and adjust info */
130  LAPACK_zggev3( &jobvl, &jobvr, &n, a_t, &lda_t, b_t, &ldb_t,
131  alpha, beta, vl_t, &ldvl_t, vr_t, &ldvr_t,
132  work, &lwork, rwork, &info );
133  if( info < 0 ) {
134  info = info - 1;
135  }
136  /* Transpose output matrices */
137  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
138  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
139  if( LAPACKE_lsame( jobvl, 'v' ) ) {
140  LAPACKE_zge_trans( LAPACK_COL_MAJOR, nrows_vl, ncols_vl, vl_t,
141  ldvl_t, vl, ldvl );
142  }
143  if( LAPACKE_lsame( jobvr, 'v' ) ) {
144  LAPACKE_zge_trans( LAPACK_COL_MAJOR, nrows_vr, ncols_vr, vr_t,
145  ldvr_t, vr, ldvr );
146  }
147  /* Release memory and exit */
148  if( LAPACKE_lsame( jobvr, 'v' ) ) {
149  LAPACKE_free( vr_t );
150  }
151 exit_level_3:
152  if( LAPACKE_lsame( jobvl, 'v' ) ) {
153  LAPACKE_free( vl_t );
154  }
155 exit_level_2:
156  LAPACKE_free( b_t );
157 exit_level_1:
158  LAPACKE_free( a_t );
159 exit_level_0:
160  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
161  LAPACKE_xerbla( "LAPACKE_zggev3_work", info );
162  }
163  } else {
164  info = -1;
165  LAPACKE_xerbla( "LAPACKE_zggev3_work", info );
166  }
167  return info;
168 }
LAPACK_zggev3
void LAPACK_zggev3(char const *jobvl, char const *jobvr, lapack_int const *n, lapack_complex_double *A, lapack_int const *lda, lapack_complex_double *B, lapack_int const *ldb, lapack_complex_double *alpha, lapack_complex_double *beta, lapack_complex_double *VL, lapack_int const *ldvl, lapack_complex_double *VR, lapack_int const *ldvr, lapack_complex_double *work, lapack_int const *lwork, double *rwork, lapack_int *info)
lapack_int
#define lapack_int
Definition: lapack.h:83
lapack_complex_double
#define lapack_complex_double
Definition: lapack.h:63
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:46
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
LAPACKE_zge_trans
void LAPACKE_zge_trans(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *in, lapack_int ldin, lapack_complex_double *out, lapack_int ldout)
Definition: lapacke_zge_trans.c:39
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:46
Here is the call graph for this function:
Here is the caller graph for this function: