LAPACK  3.5.0
LAPACK: Linear Algebra PACKage
 All Classes Files Functions Variables Typedefs Macros
lapacke_dgesvd.c File Reference
#include "lapacke_utils.h"
Include dependency graph for lapacke_dgesvd.c:

Go to the source code of this file.

Functions/Subroutines

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

Function/Subroutine Documentation

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

Definition at line 36 of file lapacke_dgesvd.c.

{
lapack_int info = 0;
lapack_int lwork = -1;
double* work = NULL;
double work_query;
if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
LAPACKE_xerbla( "LAPACKE_dgesvd", -1 );
return -1;
}
#ifndef LAPACK_DISABLE_NAN_CHECK
/* Optionally check input matrices for NaNs */
if( LAPACKE_dge_nancheck( matrix_order, m, n, a, lda ) ) {
return -6;
}
#endif
/* Query optimal working array(s) size */
info = LAPACKE_dgesvd_work( matrix_order, jobu, jobvt, m, n, a, lda, s, u,
ldu, vt, ldvt, &work_query, lwork );
if( info != 0 ) {
goto exit_level_0;
}
lwork = (lapack_int)work_query;
/* Allocate memory for work arrays */
work = (double*)LAPACKE_malloc( sizeof(double) * lwork );
if( work == NULL ) {
goto exit_level_0;
}
/* Call middle-level interface */
info = LAPACKE_dgesvd_work( matrix_order, jobu, jobvt, m, n, a, lda, s, u,
ldu, vt, ldvt, work, lwork );
/* Backup significant data from working array(s) */
for( i=0; i<MIN(m,n)-1; i++ ) {
superb[i] = work[i+1];
}
/* Release memory and exit */
LAPACKE_free( work );
exit_level_0:
if( info == LAPACK_WORK_MEMORY_ERROR ) {
LAPACKE_xerbla( "LAPACKE_dgesvd", info );
}
return info;
}

Here is the call graph for this function: