LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches
lapacke_zggsvp3_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 zggsvp3
30* Author: Intel Corporation
31*****************************************************************************/
32
33#include "lapacke_utils.h"
34
35lapack_int LAPACKE_zggsvp3_work( int matrix_layout, char jobu, char jobv,
36 char jobq, lapack_int m, lapack_int p,
37 lapack_int n, lapack_complex_double* a,
38 lapack_int lda, lapack_complex_double* b,
39 lapack_int ldb, double tola, double tolb,
40 lapack_int* k, lapack_int* l,
41 lapack_complex_double* u, lapack_int ldu,
42 lapack_complex_double* v, lapack_int ldv,
43 lapack_complex_double* q, lapack_int ldq,
44 lapack_int* iwork, double* rwork,
45 lapack_complex_double* tau,
46 lapack_complex_double* work, lapack_int lwork )
47{
48 lapack_int info = 0;
49 if( matrix_layout == LAPACK_COL_MAJOR ) {
50 /* Call LAPACK function and adjust info */
51 LAPACK_zggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda, b, &ldb, &tola,
52 &tolb, k, l, u, &ldu, v, &ldv, q, &ldq, iwork, rwork,
53 tau, work, &lwork, &info );
54 if( info < 0 ) {
55 info = info - 1;
56 }
57 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
58 lapack_int lda_t = MAX(1,m);
59 lapack_int ldb_t = MAX(1,p);
60 lapack_int ldq_t = MAX(1,n);
61 lapack_int ldu_t = MAX(1,m);
62 lapack_int ldv_t = MAX(1,p);
63 lapack_complex_double* a_t = NULL;
64 lapack_complex_double* b_t = NULL;
65 lapack_complex_double* u_t = NULL;
66 lapack_complex_double* v_t = NULL;
67 lapack_complex_double* q_t = NULL;
68 /* Check leading dimension(s) */
69 if( lda < n ) {
70 info = -9;
71 LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
72 return info;
73 }
74 if( ldb < n ) {
75 info = -11;
76 LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
77 return info;
78 }
79 if( ldq < n ) {
80 info = -21;
81 LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
82 return info;
83 }
84 if( ldu < m ) {
85 info = -17;
86 LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
87 return info;
88 }
89 if( ldv < p ) {
90 info = -19;
91 LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
92 return info;
93 }
94 /* Query optimal working array(s) size if requested */
95 if( lwork == -1 ) {
96 LAPACK_zggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a, &lda_t, b,
97 &ldb_t, &tola, &tolb, k, l, u, &ldu_t, v,
98 &ldv_t, q, &ldq_t, iwork, rwork, tau, work,
99 &lwork, &info );
100 return (info < 0) ? (info - 1) : info;
101 }
102 /* Allocate memory for temporary array(s) */
103 a_t = (lapack_complex_double*)
104 LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
105 if( a_t == NULL ) {
106 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
107 goto exit_level_0;
108 }
109 b_t = (lapack_complex_double*)
110 LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
111 if( b_t == NULL ) {
112 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
113 goto exit_level_1;
114 }
115 if( LAPACKE_lsame( jobu, 'u' ) ) {
116 u_t = (lapack_complex_double*)
117 LAPACKE_malloc( sizeof(lapack_complex_double) *
118 ldu_t * MAX(1,m) );
119 if( u_t == NULL ) {
120 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
121 goto exit_level_2;
122 }
123 }
124 if( LAPACKE_lsame( jobv, 'v' ) ) {
125 v_t = (lapack_complex_double*)
126 LAPACKE_malloc( sizeof(lapack_complex_double) *
127 ldv_t * MAX(1,p) );
128 if( v_t == NULL ) {
129 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
130 goto exit_level_3;
131 }
132 }
133 if( LAPACKE_lsame( jobq, 'q' ) ) {
134 q_t = (lapack_complex_double*)
135 LAPACKE_malloc( sizeof(lapack_complex_double) *
136 ldq_t * MAX(1,n) );
137 if( q_t == NULL ) {
138 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
139 goto exit_level_4;
140 }
141 }
142 /* Transpose input matrices */
143 LAPACKE_zge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
144 LAPACKE_zge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
145 /* Call LAPACK function and adjust info */
146 LAPACK_zggsvp3( &jobu, &jobv, &jobq, &m, &p, &n, a_t, &lda_t, b_t,
147 &ldb_t, &tola, &tolb, k, l, u_t, &ldu_t, v_t, &ldv_t,
148 q_t, &ldq_t, iwork, rwork, tau, work, &lwork, &info );
149 if( info < 0 ) {
150 info = info - 1;
151 }
152 /* Transpose output matrices */
153 LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
154 LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
155 if( LAPACKE_lsame( jobu, 'u' ) ) {
156 LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
157 }
158 if( LAPACKE_lsame( jobv, 'v' ) ) {
159 LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
160 }
161 if( LAPACKE_lsame( jobq, 'q' ) ) {
162 LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
163 }
164 /* Release memory and exit */
165 if( LAPACKE_lsame( jobq, 'q' ) ) {
166 LAPACKE_free( q_t );
167 }
168exit_level_4:
169 if( LAPACKE_lsame( jobv, 'v' ) ) {
170 LAPACKE_free( v_t );
171 }
172exit_level_3:
173 if( LAPACKE_lsame( jobu, 'u' ) ) {
174 LAPACKE_free( u_t );
175 }
176exit_level_2:
177 LAPACKE_free( b_t );
178exit_level_1:
179 LAPACKE_free( a_t );
180exit_level_0:
181 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
182 LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
183 }
184 } else {
185 info = -1;
186 LAPACKE_xerbla( "LAPACKE_zggsvp3_work", info );
187 }
188 return info;
189}
LAPACK_zggsvp3
#define LAPACK_zggsvp3(...)
Definition: lapack.h:5661
lapack_int
#define lapack_int
Definition: lapack.h:87
lapack_complex_double
#define lapack_complex_double
Definition: lapack.h:64
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:53
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:46
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:52
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:43
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:56
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
LAPACKE_zge_trans
void LAPACKE_zge_trans(int matrix_layout, lapack_int m, lapack_int n, const lapack_complex_double *in, lapack_int ldin, lapack_complex_double *out, lapack_int ldout)
Definition: lapacke_zge_trans.c:39
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:46
lapacke_utils.h
LAPACKE_zggsvp3_work
lapack_int LAPACKE_zggsvp3_work(int matrix_layout, char jobu, char jobv, char jobq, lapack_int m, lapack_int p, lapack_int n, lapack_complex_double *a, lapack_int lda, lapack_complex_double *b, lapack_int ldb, double tola, double tolb, lapack_int *k, lapack_int *l, lapack_complex_double *u, lapack_int ldu, lapack_complex_double *v, lapack_int ldv, lapack_complex_double *q, lapack_int ldq, lapack_int *iwork, double *rwork, lapack_complex_double *tau, lapack_complex_double *work, lapack_int lwork)
Definition: lapacke_zggsvp3_work.c:35