LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_cbbcsd()

lapack_int LAPACKE_cbbcsd ( int  matrix_layout,
char  jobu1,
char  jobu2,
char  jobv1t,
char  jobv2t,
char  trans,
lapack_int  m,
lapack_int  p,
lapack_int  q,
float *  theta,
float *  phi,
lapack_complex_float u1,
lapack_int  ldu1,
lapack_complex_float u2,
lapack_int  ldu2,
lapack_complex_float v1t,
lapack_int  ldv1t,
lapack_complex_float v2t,
lapack_int  ldv2t,
float *  b11d,
float *  b11e,
float *  b12d,
float *  b12e,
float *  b21d,
float *  b21e,
float *  b22d,
float *  b22e 
)

Definition at line 36 of file lapacke_cbbcsd.c.

45 {
46  lapack_int info = 0;
47  lapack_int lrwork = -1;
48  float* rwork = NULL;
49  float rwork_query;
50  int lapack_layout;
51  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
52  LAPACKE_xerbla( "LAPACKE_cbbcsd", -1 );
53  return -1;
54  }
55  if( LAPACKE_lsame( trans, 'n' ) && matrix_layout == LAPACK_COL_MAJOR ) {
56  lapack_layout = LAPACK_COL_MAJOR;
57  } else {
58  lapack_layout = LAPACK_ROW_MAJOR;
59  }
60 #ifndef LAPACK_DISABLE_NAN_CHECK
61  if( LAPACKE_get_nancheck() ) {
62  /* Optionally check input matrices for NaNs */
63  if( LAPACKE_s_nancheck( q-1, phi, 1 ) ) {
64  return -11;
65  }
66  if( LAPACKE_s_nancheck( q, theta, 1 ) ) {
67  return -10;
68  }
69  if( LAPACKE_lsame( jobu1, 'y' ) ) {
70  if( LAPACKE_cge_nancheck( lapack_layout, p, p, u1, ldu1 ) ) {
71  return -12;
72  }
73  }
74  if( LAPACKE_lsame( jobu2, 'y' ) ) {
75  if( LAPACKE_cge_nancheck( lapack_layout, m-p, m-p, u2, ldu2 ) ) {
76  return -14;
77  }
78  }
79  if( LAPACKE_lsame( jobv1t, 'y' ) ) {
80  if( LAPACKE_cge_nancheck( lapack_layout, q, q, v1t, ldv1t ) ) {
81  return -16;
82  }
83  }
84  if( LAPACKE_lsame( jobv2t, 'y' ) ) {
85  if( LAPACKE_cge_nancheck( lapack_layout, m-q, m-q, v2t, ldv2t ) ) {
86  return -18;
87  }
88  }
89  }
90 #endif
91  /* Query optimal working array(s) size */
92  info = LAPACKE_cbbcsd_work( matrix_layout, jobu1, jobu2, jobv1t, jobv2t,
93  trans, m, p, q, theta, phi, u1, ldu1, u2, ldu2,
94  v1t, ldv1t, v2t, ldv2t, b11d, b11e, b12d, b12e,
95  b21d, b21e, b22d, b22e, &rwork_query, lrwork );
96  if( info != 0 ) {
97  goto exit_level_0;
98  }
99  lrwork = (lapack_int)rwork_query;
100  /* Allocate memory for work arrays */
101  rwork = (float*)LAPACKE_malloc( sizeof(float) * lrwork );
102  if( rwork == NULL ) {
104  goto exit_level_0;
105  }
106  /* Call middle-level interface */
107  info = LAPACKE_cbbcsd_work( matrix_layout, jobu1, jobu2, jobv1t, jobv2t,
108  trans, m, p, q, theta, phi, u1, ldu1, u2, ldu2,
109  v1t, ldv1t, v2t, ldv2t, b11d, b11e, b12d, b12e,
110  b21d, b21e, b22d, b22e, rwork, lrwork );
111  /* Release memory and exit */
112  LAPACKE_free( rwork );
113 exit_level_0:
114  if( info == LAPACK_WORK_MEMORY_ERROR ) {
115  LAPACKE_xerbla( "LAPACKE_cbbcsd", info );
116  }
117  return info;
118 }
#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
lapack_logical LAPACKE_s_nancheck(lapack_int n, const float *x, lapack_int incx)
lapack_logical LAPACKE_cge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_float *a, lapack_int lda)
#define LAPACKE_malloc(size)
Definition: lapacke.h:110
lapack_int LAPACKE_cbbcsd_work(int matrix_layout, char jobu1, char jobu2, char jobv1t, char jobv2t, char trans, lapack_int m, lapack_int p, lapack_int q, float *theta, float *phi, lapack_complex_float *u1, lapack_int ldu1, lapack_complex_float *u2, lapack_int ldu2, lapack_complex_float *v1t, lapack_int ldv1t, lapack_complex_float *v2t, lapack_int ldv2t, float *b11d, float *b11e, float *b12d, float *b12e, float *b21d, float *b21e, float *b22d, float *b22e, float *rwork, lapack_int lrwork)
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
int LAPACKE_get_nancheck()
Here is the call graph for this function: