LAPACK  3.6.1
LAPACK: Linear Algebra PACKage
lapack_int LAPACKE_cgesvdx ( int  matrix_layout,
char  jobu,
char  jobvt,
char  range,
lapack_int  m,
lapack_int  n,
lapack_complex_float a,
lapack_int  lda,
float  vl,
float  vu,
lapack_int  il,
lapack_int  iu,
lapack_int ns,
float *  s,
lapack_complex_float u,
lapack_int  ldu,
lapack_complex_float vt,
lapack_int  ldvt,
lapack_int superb 
)

Definition at line 36 of file lapacke_cgesvdx.c.

43 {
44  lapack_int info = 0;
45  lapack_int lwork = -1;
46  lapack_complex_float* work = NULL;
47  lapack_complex_float work_query;
48  float* rwork = NULL;
49  lapack_int lrwork = MAX(1, MIN(m,n)*(MIN(m,n)*2+15*MIN(m,n)));
50  lapack_int* iwork = NULL;
51  lapack_int i;
52  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
53  LAPACKE_xerbla( "LAPACKE_cgesvdx", -1 );
54  return -1;
55  }
56 #ifndef LAPACK_DISABLE_NAN_CHECK
57  /* Optionally check input matrices for NaNs */
58  if( LAPACKE_cge_nancheck( matrix_layout, m, n, a, lda ) ) {
59  return -6;
60  }
61 #endif
62  /* Query optimal working array(s) size */
63  info = LAPACKE_cgesvdx_work( matrix_layout, jobu, jobvt, range,
64  m, n, a, lda, vl, vu, il, iu, ns, s, u,
65  ldu, vt, ldvt, &work_query, lwork, rwork, iwork );
66  if( info != 0 ) {
67  goto exit_level_0;
68  }
69  lwork = LAPACK_C2INT (work_query);
70  /* Allocate memory for work arrays */
71  work = (lapack_complex_float*)
72  LAPACKE_malloc( sizeof(lapack_complex_float) * lwork );
73  if( work == NULL ) {
75  goto exit_level_1;
76  }
77  rwork = (float*)LAPACKE_malloc( sizeof(float) * lrwork );
78  if( rwork == NULL ) {
80  goto exit_level_0;
81  }
82  iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,(12*MIN(m,n))) );
83  if( iwork == NULL ) {
85  goto exit_level_2;
86  }
87  /* Call middle-level interface */
88  info = LAPACKE_cgesvdx_work( matrix_layout, jobu, jobvt, range,
89  m, n, a, lda, vl, vu, il, iu, ns, s, u,
90  ldu, vt, ldvt, work, lwork, rwork, iwork );
91  /* Backup significant data from working array(s) */
92  for( i=0; i<12*MIN(m,n)-1; i++ ) {
93  superb[i] = iwork[i+1];
94  }
95  /* Release memory and exit */
96  LAPACKE_free( iwork );
97 exit_level_2:
98  LAPACKE_free( work );
99 exit_level_1:
100  LAPACKE_free( rwork );
101 exit_level_0:
102  if( info == LAPACK_WORK_MEMORY_ERROR ) {
103  LAPACKE_xerbla( "LAPACKE_cgesvdx", info );
104  }
105  return info;
106 }
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:119
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:122
#define lapack_complex_float
Definition: lapacke.h:74
#define MIN(x, y)
Definition: lapacke_utils.h:50
lapack_logical LAPACKE_cge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_float *a, lapack_int lda)
lapack_int LAPACKE_cgesvdx_work(int matrix_layout, char jobu, char jobvt, char range, lapack_int m, lapack_int n, lapack_complex_float *a, lapack_int lda, float vl, float vu, lapack_int il, lapack_int iu, lapack_int *ns, float *s, lapack_complex_float *u, lapack_int ldu, lapack_complex_float *vt, lapack_int ldvt, lapack_complex_float *work, lapack_int lwork, float *rwork, lapack_int *iwork)
#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
#define LAPACK_C2INT(x)
Definition: lapacke.h:116
#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: