LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_zuncsd2by1 ( int  matrix_layout,
char  jobu1,
char  jobu2,
char  jobv1t,
lapack_int  m,
lapack_int  p,
lapack_int  q,
lapack_complex_double x11,
lapack_int  ldx11,
lapack_complex_double x21,
lapack_int  ldx21,
double *  theta,
lapack_complex_double u1,
lapack_int  ldu1,
lapack_complex_double u2,
lapack_int  ldu2,
lapack_complex_double v1t,
lapack_int  ldv1t 
)

Definition at line 36 of file lapacke_zuncsd2by1.c.

43 {
44  lapack_int info = 0;
45  lapack_int lrwork = -1;
46  lapack_int lwork = -1;
47  lapack_int* iwork = NULL;
48  double* rwork = NULL;
49  lapack_complex_double* work = NULL;
50  double rwork_query;
51  lapack_complex_double work_query;
52  lapack_int nrows_x11, nrows_x21;
53  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
54  LAPACKE_xerbla( "LAPACKE_zuncsd2by1", -1 );
55  return -1;
56  }
57 #ifndef LAPACK_DISABLE_NAN_CHECK
58  /* Optionally check input matrices for NaNs */
59  nrows_x11 = p ;
60  nrows_x21 = m-p ;
61  if( LAPACKE_zge_nancheck( matrix_layout, nrows_x11, q, x11, ldx11 ) ) {
62  return -8;
63  }
64 
65  if( LAPACKE_zge_nancheck( matrix_layout, nrows_x21, q, x21, ldx21 ) ) {
66  return -9;
67  }
68 
69 #endif
70  /* Allocate memory for working array(s) */
71  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,m-MIN(MIN(p,m-p),MIN(q,m-q))) );
72  if( iwork == NULL ) {
74  goto exit_level_0;
75  }
76  /* Query optimal working array(s) size */
77  info = LAPACKE_zuncsd2by1_work( matrix_layout, jobu1, jobu2, jobv1t, m, p, q,
78  x11, ldx11, x21, ldx21, theta, u1, ldu1, u2,
79  ldu2, v1t, ldv1t, &work_query,
80  lwork, &rwork_query, lrwork, iwork );
81  if( info != 0 ) {
82  goto exit_level_2;
83  }
84  lrwork = (lapack_int)rwork_query;
85  lwork = LAPACK_Z2INT( work_query );
86  /* Allocate memory for work arrays */
87  rwork = (double*)LAPACKE_malloc( sizeof(double) * lrwork );
88  if( rwork == NULL ) {
90  goto exit_level_1;
91  }
93  if( work == NULL ) {
95  goto exit_level_2;
96  }
97  /* Call middle-level interface */
98  info = LAPACKE_zuncsd2by1_work( matrix_layout, jobu1, jobu2, jobv1t, m, p, q,
99  x11, ldx11, x21, ldx21, theta, u1, ldu1, u2,
100  ldu2, v1t, ldv1t, work, lwork, rwork, lrwork, iwork );
101  /* Release memory and exit */
102  LAPACKE_free( work );
103 exit_level_2:
104  LAPACKE_free( rwork );
105 exit_level_1:
106  LAPACKE_free( iwork );
107 exit_level_0:
108  if( info == LAPACK_WORK_MEMORY_ERROR ) {
109  LAPACKE_xerbla( "LAPACKE_zuncsd2by1", info );
110  }
111  return info;
112 }
#define LAPACK_Z2INT(x)
Definition: lapacke.h:117
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
#define lapack_complex_double
Definition: lapacke.h:90
#define MIN(x, y)
Definition: lapacke_utils.h:50
#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_int LAPACKE_zuncsd2by1_work(int matrix_layout, char jobu1, char jobu2, char jobv1t, lapack_int m, lapack_int p, lapack_int q, lapack_complex_double *x11, lapack_int ldx11, lapack_complex_double *x21, lapack_int ldx21, double *theta, lapack_complex_double *u1, lapack_int ldu1, lapack_complex_double *u2, lapack_int ldu2, lapack_complex_double *v1t, lapack_int ldv1t, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int lrwork, lapack_int *iwork)
#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)

Here is the call graph for this function: