LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_sorcsd ( int  matrix_layout,
char  jobu1,
char  jobu2,
char  jobv1t,
char  jobv2t,
char  trans,
char  signs,
lapack_int  m,
lapack_int  p,
lapack_int  q,
float *  x11,
lapack_int  ldx11,
float *  x12,
lapack_int  ldx12,
float *  x21,
lapack_int  ldx21,
float *  x22,
lapack_int  ldx22,
float *  theta,
float *  u1,
lapack_int  ldu1,
float *  u2,
lapack_int  ldu2,
float *  v1t,
lapack_int  ldv1t,
float *  v2t,
lapack_int  ldv2t 
)

Definition at line 36 of file lapacke_sorcsd.c.

45 {
46  lapack_int info = 0;
47  lapack_int lwork = -1;
48  lapack_int* iwork = NULL;
49  float* work = NULL;
50  float work_query;
51  lapack_int nrows_x11, nrows_x12, nrows_x21, nrows_x22;
52  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
53  LAPACKE_xerbla( "LAPACKE_sorcsd", -1 );
54  return -1;
55  }
56 #ifndef LAPACK_DISABLE_NAN_CHECK
57  /* Optionally check input matrices for NaNs */
58  nrows_x11 = ( LAPACKE_lsame( trans, 'n' ) ? p : q);
59  nrows_x12 = ( LAPACKE_lsame( trans, 'n' ) ? p : m-q);
60  nrows_x21 = ( LAPACKE_lsame( trans, 'n' ) ? m-p : q);
61  nrows_x22 = ( LAPACKE_lsame( trans, 'n' ) ? m-p : m-q);
62  if( LAPACKE_sge_nancheck( matrix_layout, nrows_x11, q, x11, ldx11 ) ) {
63  return -11;
64  }
65  if( LAPACKE_sge_nancheck( matrix_layout, nrows_x12, m-q, x12, ldx12 ) ) {
66  return -13;
67  }
68  if( LAPACKE_sge_nancheck( matrix_layout, nrows_x21, q, x21, ldx21 ) ) {
69  return -15;
70  }
71  if( LAPACKE_sge_nancheck( matrix_layout, nrows_x22, m-q, x22, ldx22 ) ) {
72  return -17;
73  }
74 #endif
75  /* Allocate memory for working array(s) */
76  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,m-MIN(MIN(p,m-p),MIN(q,m-q))) );
77  if( iwork == NULL ) {
79  goto exit_level_0;
80  }
81  /* Query optimal working array(s) size */
82  info = LAPACKE_sorcsd_work( matrix_layout, jobu1, jobu2, jobv1t, jobv2t,
83  trans, signs, m, p, q, x11, ldx11, x12, ldx12,
84  x21, ldx21, x22, ldx22, theta, u1, ldu1, u2,
85  ldu2, v1t, ldv1t, v2t, ldv2t, &work_query,
86  lwork, iwork );
87  if( info != 0 ) {
88  goto exit_level_1;
89  }
90  lwork = (lapack_int)work_query;
91  /* Allocate memory for work arrays */
92  work = (float*)LAPACKE_malloc( sizeof(float) * lwork );
93  if( work == NULL ) {
95  goto exit_level_1;
96  }
97  /* Call middle-level interface */
98  info = LAPACKE_sorcsd_work( matrix_layout, jobu1, jobu2, jobv1t, jobv2t,
99  trans, signs, m, p, q, x11, ldx11, x12, ldx12,
100  x21, ldx21, x22, ldx22, theta, u1, ldu1, u2,
101  ldu2, v1t, ldv1t, v2t, ldv2t, work, lwork,
102  iwork );
103  /* Release memory and exit */
104  LAPACKE_free( work );
105 exit_level_1:
106  LAPACKE_free( iwork );
107 exit_level_0:
108  if( info == LAPACK_WORK_MEMORY_ERROR ) {
109  LAPACKE_xerbla( "LAPACKE_sorcsd", info );
110  }
111  return info;
112 }
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
lapack_logical LAPACKE_sge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const float *a, lapack_int lda)
#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_sorcsd_work(int matrix_layout, char jobu1, char jobu2, char jobv1t, char jobv2t, char trans, char signs, lapack_int m, lapack_int p, lapack_int q, float *x11, lapack_int ldx11, float *x12, lapack_int ldx12, float *x21, lapack_int ldx21, float *x22, lapack_int ldx22, float *theta, float *u1, lapack_int ldu1, float *u2, lapack_int ldu2, float *v1t, lapack_int ldv1t, float *v2t, lapack_int ldv2t, float *work, lapack_int lwork, lapack_int *iwork)
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: