LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_dggev_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 dggev
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_dggev_work( int matrix_layout, char jobvl, char jobvr,
36 lapack_int n, double* a, lapack_int lda,
37 double* b, lapack_int ldb, double* alphar,
38 double* alphai, double* beta, double* vl,
39 lapack_int ldvl, double* vr, lapack_int ldvr,
40 double* work, lapack_int lwork )
41{
42 lapack_int info = 0;
43 if( matrix_layout == LAPACK_COL_MAJOR ) {
44 /* Call LAPACK function and adjust info */
45 LAPACK_dggev( &jobvl, &jobvr, &n, a, &lda, b, &ldb, alphar, alphai,
46 beta, vl, &ldvl, vr, &ldvr, work, &lwork, &info );
47 if( info < 0 ) {
48 info = info - 1;
49 }
50 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
51 lapack_int nrows_vl = LAPACKE_lsame( jobvl, 'v' ) ? n : 1;
52 lapack_int ncols_vl = LAPACKE_lsame( jobvl, 'v' ) ? n : 1;
53 lapack_int nrows_vr = LAPACKE_lsame( jobvr, 'v' ) ? n : 1;
54 lapack_int ncols_vr = LAPACKE_lsame( jobvr, 'v' ) ? n : 1;
55 lapack_int lda_t = MAX(1,n);
56 lapack_int ldb_t = MAX(1,n);
57 lapack_int ldvl_t = MAX(1,nrows_vl);
58 lapack_int ldvr_t = MAX(1,nrows_vr);
59 double* a_t = NULL;
60 double* b_t = NULL;
61 double* vl_t = NULL;
62 double* vr_t = NULL;
63 /* Check leading dimension(s) */
64 if( lda < n ) {
65 info = -6;
66 LAPACKE_xerbla( "LAPACKE_dggev_work", info );
67 return info;
68 }
69 if( ldb < n ) {
70 info = -8;
71 LAPACKE_xerbla( "LAPACKE_dggev_work", info );
72 return info;
73 }
74 if( ldvl < ncols_vl ) {
75 info = -13;
76 LAPACKE_xerbla( "LAPACKE_dggev_work", info );
77 return info;
78 }
79 if( ldvr < ncols_vr ) {
80 info = -15;
81 LAPACKE_xerbla( "LAPACKE_dggev_work", info );
82 return info;
83 }
84 /* Query optimal working array(s) size if requested */
85 if( lwork == -1 ) {
86 LAPACK_dggev( &jobvl, &jobvr, &n, a, &lda_t, b, &ldb_t, alphar,
87 alphai, beta, vl, &ldvl_t, vr, &ldvr_t, work, &lwork,
88 &info );
89 return (info < 0) ? (info - 1) : info;
90 }
91 /* Allocate memory for temporary array(s) */
92 a_t = (double*)LAPACKE_malloc( sizeof(double) * lda_t * MAX(1,n) );
93 if( a_t == NULL ) {
95 goto exit_level_0;
96 }
97 b_t = (double*)LAPACKE_malloc( sizeof(double) * ldb_t * MAX(1,n) );
98 if( b_t == NULL ) {
100 goto exit_level_1;
101 }
102 if( LAPACKE_lsame( jobvl, 'v' ) ) {
103 vl_t = (double*)
104 LAPACKE_malloc( sizeof(double) * ldvl_t * MAX(1,ncols_vl) );
105 if( vl_t == NULL ) {
107 goto exit_level_2;
108 }
109 }
110 if( LAPACKE_lsame( jobvr, 'v' ) ) {
111 vr_t = (double*)
112 LAPACKE_malloc( sizeof(double) * ldvr_t * MAX(1,ncols_vr) );
113 if( vr_t == NULL ) {
115 goto exit_level_3;
116 }
117 }
118 /* Transpose input matrices */
119 LAPACKE_dge_trans( matrix_layout, n, n, a, lda, a_t, lda_t );
120 LAPACKE_dge_trans( matrix_layout, n, n, b, ldb, b_t, ldb_t );
121 /* Call LAPACK function and adjust info */
122 LAPACK_dggev( &jobvl, &jobvr, &n, a_t, &lda_t, b_t, &ldb_t, alphar,
123 alphai, beta, vl_t, &ldvl_t, vr_t, &ldvr_t, work, &lwork,
124 &info );
125 if( info < 0 ) {
126 info = info - 1;
127 }
128 /* Transpose output matrices */
129 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, a_t, lda_t, a, lda );
130 LAPACKE_dge_trans( LAPACK_COL_MAJOR, n, n, b_t, ldb_t, b, ldb );
131 if( LAPACKE_lsame( jobvl, 'v' ) ) {
132 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrows_vl, ncols_vl, vl_t,
133 ldvl_t, vl, ldvl );
134 }
135 if( LAPACKE_lsame( jobvr, 'v' ) ) {
136 LAPACKE_dge_trans( LAPACK_COL_MAJOR, nrows_vr, ncols_vr, vr_t,
137 ldvr_t, vr, ldvr );
138 }
139 /* Release memory and exit */
140 if( LAPACKE_lsame( jobvr, 'v' ) ) {
141 LAPACKE_free( vr_t );
142 }
143exit_level_3:
144 if( LAPACKE_lsame( jobvl, 'v' ) ) {
145 LAPACKE_free( vl_t );
146 }
147exit_level_2:
148 LAPACKE_free( b_t );
149exit_level_1:
150 LAPACKE_free( a_t );
151exit_level_0:
152 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
153 LAPACKE_xerbla( "LAPACKE_dggev_work", info );
154 }
155 } else {
156 info = -1;
157 LAPACKE_xerbla( "LAPACKE_dggev_work", info );
158 }
159 return info;
160}
#define lapack_int
Definition: lapack.h:87
#define LAPACK_dggev(...)
Definition: lapack.h:4699
#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_dggev_work(int matrix_layout, char jobvl, char jobvr, lapack_int n, double *a, lapack_int lda, double *b, lapack_int ldb, double *alphar, double *alphai, double *beta, double *vl, lapack_int ldvl, double *vr, lapack_int ldvr, double *work, lapack_int lwork)
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
void LAPACKE_xerbla(const char *name, lapack_int info)
#define MAX(x, y)
Definition: lapacke_utils.h:46
void LAPACKE_dge_trans(int matrix_layout, lapack_int m, lapack_int n, const double *in, lapack_int ldin, double *out, lapack_int ldout)