LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_zggsvp3_work ( int  matrix_layout,
char  jobu,
char  jobv,
char  jobq,
lapack_int  m,
lapack_int  p,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
lapack_complex_double b,
lapack_int  ldb,
double  tola,
double  tolb,
lapack_int k,
lapack_int l,
lapack_complex_double u,
lapack_int  ldu,
lapack_complex_double v,
lapack_int  ldv,
lapack_complex_double q,
lapack_int  ldq,
lapack_int iwork,
double *  rwork,
lapack_complex_double tau,
lapack_complex_double work,
lapack_int  lwork 
)

Definition at line 36 of file lapacke_zggsvp3_work.c.

48 {
49  lapack_int info = 0;
50  if( matrix_layout == LAPACK_COL_MAJOR ) {
51  /* Call LAPACK function and adjust info */
52  LAPACK_zggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda, b, &ldb, &tola,
53  &tolb, k, l, u, &ldu, v, &ldv, q, &ldq, iwork, rwork,
54  tau, work, &lwork, &info );
55  if( info < 0 ) {
56  info = info - 1;
57  }
58  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
59  lapack_int lda_t = MAX(1,m);
60  lapack_int ldb_t = MAX(1,p);
61  lapack_int ldq_t = MAX(1,n);
62  lapack_int ldu_t = MAX(1,m);
63  lapack_int ldv_t = MAX(1,p);
64  lapack_complex_double* a_t = NULL;
65  lapack_complex_double* b_t = NULL;
66  lapack_complex_double* u_t = NULL;
67  lapack_complex_double* v_t = NULL;
68  lapack_complex_double* q_t = NULL;
69  /* Check leading dimension(s) */
70  if( lda < n ) {
71  info = -9;
72  LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
73  return info;
74  }
75  if( ldb < n ) {
76  info = -11;
77  LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
78  return info;
79  }
80  if( ldq < n ) {
81  info = -21;
82  LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
83  return info;
84  }
85  if( ldu < m ) {
86  info = -17;
87  LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
88  return info;
89  }
90  if( ldv < p ) {
91  info = -19;
92  LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
93  return info;
94  }
95  /* Query optimal working array(s) size if requested */
96  if( lwork == -1 ) {
97  LAPACK_zggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda_t, b,
98  &ldb_t, &tola, &tolb, k, l, u, &ldu_t, v,
99  &ldv_t, q, &ldq_t, iwork, rwork, tau, work,
100  &lwork, &info );
101  return (info < 0) ? (info - 1) : info;
102  }
103  /* Allocate memory for temporary array(s) */
104  a_t = (lapack_complex_double*)
105  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
106  if( a_t == NULL ) {
108  goto exit_level_0;
109  }
110  b_t = (lapack_complex_double*)
111  LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
112  if( b_t == NULL ) {
114  goto exit_level_1;
115  }
116  if( LAPACKE_lsame( jobu, 'u' ) ) {
117  u_t = (lapack_complex_double*)
119  ldu_t * MAX(1,m) );
120  if( u_t == NULL ) {
122  goto exit_level_2;
123  }
124  }
125  if( LAPACKE_lsame( jobv, 'v' ) ) {
126  v_t = (lapack_complex_double*)
128  ldv_t * MAX(1,p) );
129  if( v_t == NULL ) {
131  goto exit_level_3;
132  }
133  }
134  if( LAPACKE_lsame( jobq, 'q' ) ) {
135  q_t = (lapack_complex_double*)
137  ldq_t * MAX(1,n) );
138  if( q_t == NULL ) {
140  goto exit_level_4;
141  }
142  }
143  /* Transpose input matrices */
144  LAPACKE_zge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
145  LAPACKE_zge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
146  /* Call LAPACK function and adjust info */
147  LAPACK_zggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a_t, &lda_t, b_t,
148  &ldb_t, &tola, &tolb, k, l, u_t, &ldu_t, v_t, &ldv_t,
149  q_t, &ldq_t, iwork, rwork, tau, work, &lwork, &info );
150  if( info < 0 ) {
151  info = info - 1;
152  }
153  /* Transpose output matrices */
154  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
155  LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
156  if( LAPACKE_lsame( jobu, 'u' ) ) {
157  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
158  }
159  if( LAPACKE_lsame( jobv, 'v' ) ) {
160  LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
161  }
162  if( LAPACKE_lsame( jobq, 'q' ) ) {
163  LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
164  }
165  /* Release memory and exit */
166  if( LAPACKE_lsame( jobq, 'q' ) ) {
167  LAPACKE_free( q_t );
168  }
169 exit_level_4:
170  if( LAPACKE_lsame( jobv, 'v' ) ) {
171  LAPACKE_free( v_t );
172  }
173 exit_level_3:
174  if( LAPACKE_lsame( jobu, 'u' ) ) {
175  LAPACKE_free( u_t );
176  }
177 exit_level_2:
178  LAPACKE_free( b_t );
179 exit_level_1:
180  LAPACKE_free( a_t );
181 exit_level_0:
182  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
183  LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
184  }
185  } else {
186  info = -1;
187  LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
188  }
189  return info;
190 }
void LAPACK_zggsvp3(char *jobu, char *jobv, char *jobq, lapack_int *m, lapack_int *p, lapack_int *n, lapack_complex_double *a, lapack_int *lda, lapack_complex_double *b, lapack_int *ldb, double *tola, double *tolb, lapack_int *k, lapack_int *l, lapack_complex_double *u, lapack_int *ldu, lapack_complex_double *v, lapack_int *ldv, lapack_complex_double *q, lapack_int *ldq, lapack_int *iwork, double *rwork, lapack_complex_double *tau, lapack_complex_double *work, lapack_int *lwork, lapack_int *info)
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define lapack_complex_double
Definition: lapacke.h:90
#define MAX(x, y)
Definition: lapacke_utils.h:47
#define LAPACKE_free(p)
Definition: lapacke.h:113
#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
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:123
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)

Here is the call graph for this function:

Here is the caller graph for this function: