LAPACK  3.9.0
LAPACK: Linear Algebra PACKage

◆ LAPACKE_zgesvd()

lapack_int LAPACKE_zgesvd ( int  matrix_layout,
char  jobu,
char  jobvt,
lapack_int  m,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
double *  s,
lapack_complex_double u,
lapack_int  ldu,
lapack_complex_double vt,
lapack_int  ldvt,
double *  superb 
)

Definition at line 35 of file lapacke_zgesvd.c.

41 {
42  lapack_int info = 0;
43  lapack_int lwork = -1;
44  double* rwork = NULL;
45  lapack_complex_double* work = NULL;
46  lapack_complex_double work_query;
47  lapack_int i;
48  if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
49  LAPACKE_xerbla( "LAPACKE_zgesvd", -1 );
50  return -1;
51  }
52 #ifndef LAPACK_DISABLE_NAN_CHECK
53  if( LAPACKE_get_nancheck() ) {
54  /* Optionally check input matrices for NaNs */
55  if( LAPACKE_zge_nancheck( matrix_layout, m, n, a, lda ) ) {
56  return -6;
57  }
58  }
59 #endif
60  /* Allocate memory for working array(s) */
61  rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,5*MIN(m,n)) );
62  if( rwork == NULL ) {
64  goto exit_level_0;
65  }
66  /* Query optimal working array(s) size */
67  info = LAPACKE_zgesvd_work( matrix_layout, jobu, jobvt, m, n, a, lda, s, u,
68  ldu, vt, ldvt, &work_query, lwork, rwork );
69  if( info != 0 ) {
70  goto exit_level_1;
71  }
72  lwork = LAPACK_Z2INT( work_query );
73  /* Allocate memory for work arrays */
74  work = (lapack_complex_double*)
75  LAPACKE_malloc( sizeof(lapack_complex_double) * lwork );
76  if( work == NULL ) {
78  goto exit_level_1;
79  }
80  /* Call middle-level interface */
81  info = LAPACKE_zgesvd_work( matrix_layout, jobu, jobvt, m, n, a, lda, s, u,
82  ldu, vt, ldvt, work, lwork, rwork );
83  /* Backup significant data from working array(s) */
84  for( i=0; i<MIN(m,n)-1; i++ ) {
85  superb[i] = rwork[i];
86  }
87  /* Release memory and exit */
88  LAPACKE_free( work );
89 exit_level_1:
90  LAPACKE_free( rwork );
91 exit_level_0:
92  if( info == LAPACK_WORK_MEMORY_ERROR ) {
93  LAPACKE_xerbla( "LAPACKE_zgesvd", info );
94  }
95  return info;
Here is the call graph for this function:
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:47
lapack_int
#define lapack_int
Definition: lapack.h:21
LAPACKE_zgesvd_work
lapack_int LAPACKE_zgesvd_work(int matrix_layout, char jobu, char jobvt, lapack_int m, lapack_int n, lapack_complex_double *a, lapack_int lda, double *s, lapack_complex_double *u, lapack_int ldu, lapack_complex_double *vt, lapack_int ldvt, lapack_complex_double *work, lapack_int lwork, double *rwork)
Definition: lapacke_zgesvd_work.c:35
LAPACK_WORK_MEMORY_ERROR
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:56
LAPACK_Z2INT
#define LAPACK_Z2INT(x)
Definition: lapacke.h:51
MIN
#define MIN(x, y)
Definition: lapacke_utils.h:50
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:47
lapack_complex_double
#define lapack_complex_double
Definition: lapack.h:70
LAPACKE_zge_nancheck
lapack_logical LAPACKE_zge_nancheck(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *a, lapack_int lda)
Definition: lapacke_zge_nancheck.c:36
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:44
LAPACKE_get_nancheck
int LAPACKE_get_nancheck()
Definition: lapacke_nancheck.c:42
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:53
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:54