LAPACK  3.7.1
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dbbcsd()

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

Definition at line 36 of file lapacke_dbbcsd.c.

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