LAPACK  3.9.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zgesvdq_work()

lapack_int LAPACKE_zgesvdq_work ( int  matrix_layout,
char  joba,
char  jobp,
char  jobr,
char  jobu,
char  jobv,
lapack_int  m,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
double *  s,
lapack_complex_double u,
lapack_int  ldu,
lapack_complex_double v,
lapack_int  ldv,
lapack_int numrank,
lapack_int iwork,
lapack_int  liwork,
lapack_complex_double cwork,
lapack_int  lcwork,
double *  rwork,
lapack_int  lrwork 
)

Definition at line 35 of file lapacke_zgesvdq_work.c.

44 {
45  lapack_int info = 0;
46  if( matrix_layout == LAPACK_COL_MAJOR ) {
47  /* Call LAPACK function and adjust info */
48  LAPACK_zgesvdq( &joba, &jobp, &jobr, &jobu, &jobv, &m, &n, a, &lda, s, u, &ldu, v, &ldv,
49  numrank, iwork, &liwork, cwork, &lcwork, rwork, &lrwork, &info );
50  if( info < 0 ) {
51  info = info - 1;
52  }
53  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
54  lapack_int nrows_u = ( LAPACKE_lsame( jobu, 'a' ) ||
55  LAPACKE_lsame( jobu, 's' ) ) ? m : 1;
56  lapack_int ncols_u = LAPACKE_lsame( jobu, 'a' ) ? m :
57  (LAPACKE_lsame( jobu, 's' ) ? MIN(m,n) : 1);
58  lapack_int nrows_v = LAPACKE_lsame( jobv, 'a' ) ? n :
59  ( LAPACKE_lsame( jobv, 's' ) ? MIN(m,n) : 1);
60  lapack_int lda_t = MAX(1,m);
61  lapack_int ldu_t = MAX(1,nrows_u);
62  lapack_int ldv_t = MAX(1,nrows_v);
63  lapack_complex_double* a_t = NULL;
64  lapack_complex_double* u_t = NULL;
65  lapack_complex_double* v_t = NULL;
66  /* Check leading dimension(s) */
67  if( lda < n ) {
68  info = -9;
69  LAPACKE_xerbla( "LAPACKE_zgesvdq_work", info );
70  return info;
71  }
72  if( ldu < ncols_u ) {
73  info = -12;
74  LAPACKE_xerbla( "LAPACKE_zgesvdq_work", info );
75  return info;
76  }
77  if( ldv < n ) {
78  info = -14;
79  LAPACKE_xerbla( "LAPACKE_zgesvdq_work", info );
80  return info;
81  }
82  /* Query optimal working array(s) size if requested */
83  if( lcwork == -1 ) {
84  LAPACK_zgesvdq( &joba, &jobp, &jobr, &jobu, &jobv, &m, &n, a, &lda_t,
85  s, u, &ldu_t, v, &ldv_t, numrank, iwork, &liwork,
86  cwork, &lcwork, rwork, &lrwork, &info );
87  return (info < 0) ? (info - 1) : info;
88  }
89  /* Allocate memory for temporary array(s) */
90  a_t = (lapack_complex_double*)LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
91  if( a_t == NULL ) {
93  goto exit_level_0;
94  }
95  if( LAPACKE_lsame( jobu, 'a' ) || LAPACKE_lsame( jobu, 's' ) ) {
96  u_t = (lapack_complex_double*)
97  LAPACKE_malloc( sizeof(lapack_complex_double) * ldu_t * MAX(1,ncols_u) );
98  if( u_t == NULL ) {
100  goto exit_level_1;
101  }
102  }
103  if( LAPACKE_lsame( jobv, 'a' ) || LAPACKE_lsame( jobv, 's' ) ) {
104  v_t = (lapack_complex_double*)
105  LAPACKE_malloc( sizeof(lapack_complex_double) * ldv_t * MAX(1,n) );
106  if( v_t == NULL ) {
108  goto exit_level_2;
109  }
110  }
111  /* Transpose input matrices */
112  LAPACKE_zge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
113  /* Call LAPACK function and adjust info */
114  LAPACK_zgesvdq( &joba, &jobp, &jobr, &jobu, &jobv, &m, &n, a, &lda_t,
115  s, u, &ldu_t, v, &ldv_t, numrank, iwork, &liwork,
116  cwork, &lcwork, rwork, &lrwork, &info );
117  if( info < 0 ) {
118  info = info - 1;
119  }
120  /* Transpose output matrices */
121  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
122  if( LAPACKE_lsame( jobu, 'a' ) || LAPACKE_lsame( jobu, 's' ) ) {
123  LAPACKE_zge_trans( LAPACK_COL_MAJOR, nrows_u, ncols_u, u_t, ldu_t,
124  u, ldu );
125  }
126  if( LAPACKE_lsame( jobv, 'a' ) || LAPACKE_lsame( jobv, 's' ) ) {
127  LAPACKE_zge_trans( LAPACK_COL_MAJOR, nrows_v, n, v_t, ldv_t, v,
128  ldv );
129  }
130  /* Release memory and exit */
131  if( LAPACKE_lsame( jobv, 'a' ) || LAPACKE_lsame( jobv, 's' ) ) {
132  LAPACKE_free( v_t );
133  }
134 exit_level_2:
135  if( LAPACKE_lsame( jobu, 'a' ) || LAPACKE_lsame( jobu, 's' ) ) {
136  LAPACKE_free( u_t );
137  }
138 exit_level_1:
139  LAPACKE_free( a_t );
140 exit_level_0:
141  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
142  LAPACKE_xerbla( "LAPACKE_zgesvdq_work", info );
143  }
144  } else {
145  info = -1;
146  LAPACKE_xerbla( "LAPACKE_zgesvdq_work", info );
147  }
148  return info;
Here is the call graph for this function:
Here is the caller graph for this function:
LAPACK_zgesvdq
void LAPACK_zgesvdq(char const *joba, char const *jobp, char const *jobr, char const *jobu, char const *jobv, lapack_int const *m, lapack_int const *n, lapack_complex_double *A, lapack_int const *lda, double *S, lapack_complex_double *U, lapack_int const *ldu, lapack_complex_double *V, lapack_int const *ldv, lapack_int *numrank, lapack_int *iwork, lapack_int const *liwork, lapack_complex_float *cwork, lapack_int *lcwork, double *rwork, lapack_int const *lrwork, lapack_int *info)
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:47
lapack_int
#define lapack_int
Definition: lapack.h:21
MIN
#define MIN(x, y)
Definition: lapacke_utils.h:50
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:47
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:57
lapack_complex_double
#define lapack_complex_double
Definition: lapack.h:70
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:44
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:53
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:54
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