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

Go to the source code of this file.

Functions/Subroutines

lapack_int LAPACKE_zheev (int matrix_order, char jobz, char uplo, lapack_int n, lapack_complex_double *a, lapack_int lda, double *w)

Function/Subroutine Documentation

lapack_int LAPACKE_zheev ( int  matrix_order,
char  jobz,
char  uplo,
lapack_int  n,
lapack_complex_double a,
lapack_int  lda,
double *  w 
)

Definition at line 36 of file lapacke_zheev.c.

{
lapack_int info = 0;
lapack_int lwork = -1;
double* rwork = NULL;
lapack_complex_double* work = NULL;
if( matrix_order != LAPACK_COL_MAJOR && matrix_order != LAPACK_ROW_MAJOR ) {
LAPACKE_xerbla( "LAPACKE_zheev", -1 );
return -1;
}
#ifndef LAPACK_DISABLE_NAN_CHECK
/* Optionally check input matrices for NaNs */
if( LAPACKE_zhe_nancheck( matrix_order, uplo, n, a, lda ) ) {
return -5;
}
#endif
/* Allocate memory for working array(s) */
rwork = (double*)LAPACKE_malloc( sizeof(double) * MAX(1,3*n-2) );
if( rwork == NULL ) {
goto exit_level_0;
}
/* Query optimal working array(s) size */
info = LAPACKE_zheev_work( matrix_order, jobz, uplo, n, a, lda, w,
&work_query, lwork, rwork );
if( info != 0 ) {
goto exit_level_1;
}
lwork = LAPACK_Z2INT( work_query );
/* Allocate memory for work arrays */
if( work == NULL ) {
goto exit_level_1;
}
/* Call middle-level interface */
info = LAPACKE_zheev_work( matrix_order, jobz, uplo, n, a, lda, w, work,
lwork, rwork );
/* Release memory and exit */
LAPACKE_free( work );
exit_level_1:
LAPACKE_free( rwork );
exit_level_0:
if( info == LAPACK_WORK_MEMORY_ERROR ) {
LAPACKE_xerbla( "LAPACKE_zheev", info );
}
return info;
}

Here is the call graph for this function: