LAPACK  3.8.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_dorcsd()

lapack_int LAPACKE_dorcsd ( int  matrix_layout,
char  jobu1,
char  jobu2,
char  jobv1t,
char  jobv2t,
char  trans,
char  signs,
lapack_int  m,
lapack_int  p,
lapack_int  q,
double *  x11,
lapack_int  ldx11,
double *  x12,
lapack_int  ldx12,
double *  x21,
lapack_int  ldx21,
double *  x22,
lapack_int  ldx22,
double *  theta,
double *  u1,
lapack_int  ldu1,
double *  u2,
lapack_int  ldu2,
double *  v1t,
lapack_int  ldv1t,
double *  v2t,
lapack_int  ldv2t 
)

Definition at line 36 of file lapacke_dorcsd.c.

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