LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_cuncsd2by1()

lapack_int LAPACKE_cuncsd2by1 ( int  matrix_layout,
char  jobu1,
char  jobu2,
char  jobv1t,
lapack_int  m,
lapack_int  p,
lapack_int  q,
lapack_complex_float x11,
lapack_int  ldx11,
lapack_complex_float x21,
lapack_int  ldx21,
float *  theta,
lapack_complex_float u1,
lapack_int  ldu1,
lapack_complex_float u2,
lapack_int  ldu2,
lapack_complex_float v1t,
lapack_int  ldv1t 
)

Definition at line 36 of file lapacke_cuncsd2by1.c.

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