LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_cheevx.c
Go to the documentation of this file.
1/*****************************************************************************
2 Copyright (c) 2014, Intel Corp.
3 All rights reserved.
4
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions are met:
7
8 * Redistributions of source code must retain the above copyright notice,
9 this list of conditions and the following disclaimer.
10 * Redistributions in binary form must reproduce the above copyright
11 notice, this list of conditions and the following disclaimer in the
12 documentation and/or other materials provided with the distribution.
13 * Neither the name of Intel Corporation nor the names of its contributors
14 may be used to endorse or promote products derived from this software
15 without specific prior written permission.
16
17 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
27 THE POSSIBILITY OF SUCH DAMAGE.
28*****************************************************************************
29* Contents: Native high-level C interface to LAPACK function cheevx
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_cheevx( int matrix_layout, char jobz, char range, char uplo,
37 lapack_int lda, float vl, float vu, lapack_int il,
38 lapack_int iu, float abstol, lapack_int* m, float* w,
40 lapack_int* ifail )
41{
42 lapack_int info = 0;
43 lapack_int lwork = -1;
44 lapack_int* iwork = NULL;
45 float* rwork = NULL;
46 lapack_complex_float* work = NULL;
47 lapack_complex_float work_query;
48 if( matrix_layout != LAPACK_COL_MAJOR && matrix_layout != LAPACK_ROW_MAJOR ) {
49 LAPACKE_xerbla( "LAPACKE_cheevx", -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_che_nancheck( matrix_layout, uplo, n, a, lda ) ) {
56 return -6;
57 }
58 if( LAPACKE_s_nancheck( 1, &abstol, 1 ) ) {
59 return -12;
60 }
61 if( LAPACKE_lsame( range, 'v' ) ) {
62 if( LAPACKE_s_nancheck( 1, &vl, 1 ) ) {
63 return -8;
64 }
65 }
66 if( LAPACKE_lsame( range, 'v' ) ) {
67 if( LAPACKE_s_nancheck( 1, &vu, 1 ) ) {
68 return -9;
69 }
70 }
71 }
72#endif
73 /* Allocate memory for working array(s) */
74 iwork = (lapack_int*)LAPACKE_malloc( sizeof(lapack_int) * MAX(1,5*n) );
75 if( iwork == NULL ) {
77 goto exit_level_0;
78 }
79 rwork = (float*)LAPACKE_malloc( sizeof(float) * MAX(1,7*n) );
80 if( rwork == NULL ) {
82 goto exit_level_1;
83 }
84 /* Query optimal working array(s) size */
85 info = LAPACKE_cheevx_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
86 vu, il, iu, abstol, m, w, z, ldz, &work_query,
87 lwork, rwork, iwork, ifail );
88 if( info != 0 ) {
89 goto exit_level_2;
90 }
91 lwork = LAPACK_C2INT( work_query );
92 /* Allocate memory for work arrays */
93 work = (lapack_complex_float*)
94 LAPACKE_malloc( sizeof(lapack_complex_float) * lwork );
95 if( work == NULL ) {
97 goto exit_level_2;
98 }
99 /* Call middle-level interface */
100 info = LAPACKE_cheevx_work( matrix_layout, jobz, range, uplo, n, a, lda, vl,
101 vu, il, iu, abstol, m, w, z, ldz, work, lwork,
102 rwork, iwork, ifail );
103 /* Release memory and exit */
104 LAPACKE_free( work );
105exit_level_2:
106 LAPACKE_free( rwork );
107exit_level_1:
108 LAPACKE_free( iwork );
109exit_level_0:
110 if( info == LAPACK_WORK_MEMORY_ERROR ) {
111 LAPACKE_xerbla( "LAPACKE_cheevx", info );
112 }
113 return info;
114}
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_float
Definition: lapack.h:46
#define LAPACK_WORK_MEMORY_ERROR
Definition: lapacke.h:55
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACK_C2INT(x)
Definition: lapacke.h:49
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
lapack_int LAPACKE_cheevx_work(int matrix_layout, char jobz, char range, char uplo, lapack_int n, lapack_complex_float *a, lapack_int lda, float vl, float vu, lapack_int il, lapack_int iu, float abstol, lapack_int *m, float *w, lapack_complex_float *z, lapack_int ldz, lapack_complex_float *work, lapack_int lwork, float *rwork, lapack_int *iwork, lapack_int *ifail)
int LAPACKE_get_nancheck(void)
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
lapack_int LAPACKE_cheevx(int matrix_layout, char jobz, char range, char uplo, lapack_int n, lapack_complex_float *a, lapack_int lda, float vl, float vu, lapack_int il, lapack_int iu, float abstol, lapack_int *m, float *w, lapack_complex_float *z, lapack_int ldz, lapack_int *ifail)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
lapack_logical LAPACKE_che_nancheck(int matrix_layout, char uplo, lapack_int n, const lapack_complex_float *a, lapack_int lda)
lapack_logical LAPACKE_s_nancheck(lapack_int n, const float *x, lapack_int incx)
#define MAX(x, y)
Definition: lapacke_utils.h:46