LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_sbbcsd()

lapack_int LAPACKE_sbbcsd ( 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,
float *  u1,
lapack_int  ldu1,
float *  u2,
lapack_int  ldu2,
float *  v1t,
lapack_int  ldv1t,
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_sbbcsd.c.

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