LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_cheevx_work.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 middle-level C interface to LAPACK function cheevx
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_cheevx_work( int matrix_layout, char jobz, char range,
36 char uplo, lapack_int n,
38 float vl, float vu, lapack_int il,
39 lapack_int iu, float abstol, lapack_int* m,
40 float* w, lapack_complex_float* z,
42 lapack_int lwork, float* rwork,
43 lapack_int* iwork, lapack_int* ifail )
44{
45 lapack_int info = 0;
46 if( matrix_layout == LAPACK_COL_MAJOR ) {
47 /* Call LAPACK function and adjust info */
48 LAPACK_cheevx( &jobz, &range, &uplo, &n, a, &lda, &vl, &vu, &il, &iu,
49 &abstol, m, w, z, &ldz, work, &lwork, rwork, iwork,
50 ifail, &info );
51 if( info < 0 ) {
52 info = info - 1;
53 }
54 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
55 lapack_int ncols_z = ( !LAPACKE_lsame( jobz, 'v' ) ) ? 1 :
56 ( LAPACKE_lsame( range, 'a' ) ||
57 LAPACKE_lsame( range, 'v' ) ) ? n :
58 ( LAPACKE_lsame( range, 'i' ) ? (iu-il+1) : 1);
59 lapack_int lda_t = MAX(1,n);
60 lapack_int ldz_t = MAX(1,n);
61 lapack_complex_float* a_t = NULL;
62 lapack_complex_float* z_t = NULL;
63 /* Check leading dimension(s) */
64 if( lda < n ) {
65 info = -7;
66 LAPACKE_xerbla( "LAPACKE_cheevx_work", info );
67 return info;
68 }
69 if( ldz < ncols_z ) {
70 info = -16;
71 LAPACKE_xerbla( "LAPACKE_cheevx_work", info );
72 return info;
73 }
74 /* Query optimal working array(s) size if requested */
75 if( lwork == -1 ) {
76 LAPACK_cheevx( &jobz, &range, &uplo, &n, a, &lda_t, &vl, &vu, &il,
77 &iu, &abstol, m, w, z, &ldz_t, work, &lwork, rwork,
78 iwork, ifail, &info );
79 return (info < 0) ? (info - 1) : info;
80 }
81 /* Allocate memory for temporary array(s) */
83 LAPACKE_malloc( sizeof(lapack_complex_float) * lda_t * MAX(1,n) );
84 if( a_t == NULL ) {
86 goto exit_level_0;
87 }
88 if( LAPACKE_lsame( jobz, 'v' ) ) {
91 ldz_t * MAX(1,ncols_z) );
92 if( z_t == NULL ) {
94 goto exit_level_1;
95 }
96 }
97 /* Transpose input matrices */
98 LAPACKE_che_trans( matrix_layout, uplo, n, a, lda, a_t, lda_t );
99 /* Call LAPACK function and adjust info */
100 LAPACK_cheevx( &jobz, &range, &uplo, &n, a_t, &lda_t, &vl, &vu, &il,
101 &iu, &abstol, m, w, z_t, &ldz_t, work, &lwork, rwork,
102 iwork, ifail, &info );
103 if( info < 0 ) {
104 info = info - 1;
105 }
106 /* Transpose output matrices */
107 LAPACKE_che_trans( LAPACK_COL_MAJOR, uplo, n, a_t, lda_t, a, lda );
108 if( LAPACKE_lsame( jobz, 'v' ) ) {
109 LAPACKE_cge_trans( LAPACK_COL_MAJOR, n, ncols_z, z_t, ldz_t, z,
110 ldz );
111 }
112 /* Release memory and exit */
113 if( LAPACKE_lsame( jobz, 'v' ) ) {
114 LAPACKE_free( z_t );
115 }
116exit_level_1:
117 LAPACKE_free( a_t );
118exit_level_0:
119 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
120 LAPACKE_xerbla( "LAPACKE_cheevx_work", info );
121 }
122 } else {
123 info = -1;
124 LAPACKE_xerbla( "LAPACKE_cheevx_work", info );
125 }
126 return info;
127}
#define LAPACK_cheevx(...)
Definition: lapack.h:7007
#define lapack_int
Definition: lapack.h:87
#define lapack_complex_float
Definition: lapack.h:46
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
#define LAPACKE_free(p)
Definition: lapacke.h:46
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
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)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
void LAPACKE_che_trans(int matrix_layout, char uplo, lapack_int n, const lapack_complex_float *in, lapack_int ldin, lapack_complex_float *out, lapack_int ldout)
#define MAX(x, y)
Definition: lapacke_utils.h:46
void LAPACKE_cge_trans(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_float *in, lapack_int ldin, lapack_complex_float *out, lapack_int ldout)