LAPACK  3.9.0
LAPACK: Linear Algebra PACKage
lapacke_zgesvdx_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 zgesvdx
30 * Author: Intel Corporation
31 * Generated June 2016
32 *****************************************************************************/
33 
34 #include "lapacke_utils.h"
35 
36 lapack_int LAPACKE_zgesvdx_work( int matrix_layout, char jobu, char jobvt, char range,
37  lapack_int m, lapack_int n, lapack_complex_double* a,
38  lapack_int lda, double vl, double vu,
39  lapack_int il, lapack_int iu, lapack_int* ns,
40  double* s, lapack_complex_double* u, lapack_int ldu,
41  lapack_complex_double* vt, lapack_int ldvt,
42  lapack_complex_double* work, lapack_int lwork,
43  double* rwork, lapack_int* iwork )
44 {
45  lapack_int info = 0;
46  if( matrix_layout == LAPACK_COL_MAJOR ) {
47  /* Call LAPACK function and adjust info */
48  LAPACK_zgesvdx( &jobu, &jobvt, &range, &m, &n, a, &lda, &vl, &vu,
49  &il, &iu, ns, s, u, &ldu, vt, &ldvt,
50  work, &lwork, rwork, iwork, &info );
51  if( info < 0 ) {
52  info = info - 1;
53  }
54  } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
55  lapack_int nrows_u = LAPACKE_lsame( jobu, 'v' ) ? m : 0;
56  lapack_int ncols_u = LAPACKE_lsame( jobu, 'v' ) ?
57  ( LAPACKE_lsame( range, 'i' ) ? MAX(iu - il + 1, 0) : MIN(m,n)) : 0;
58  lapack_int nrows_vt = LAPACKE_lsame( jobvt, 'v' ) ?
59  ( LAPACKE_lsame( range, 'i' ) ? MAX(iu - il + 1, 0) : MIN(m,n)) : 0;
60  lapack_int ncols_vt = LAPACKE_lsame( jobvt, 'v' ) ? n : 0;
61 
62  lapack_int lda_t = MAX(1,m);
63  lapack_int ldu_t = MAX(1,nrows_u);
64  lapack_int ldvt_t = MAX(1,nrows_vt);
65 
66  lapack_complex_double* a_t = NULL;
67  lapack_complex_double* u_t = NULL;
68  lapack_complex_double* vt_t = NULL;
69  /* Check leading dimension(s) */
70  if( lda < n ) {
71  info = -8;
72  LAPACKE_xerbla( "LAPACKE_zgesvdx_work", info );
73  return info;
74  }
75  if( ldu < ncols_u ) {
76  info = -16;
77  LAPACKE_xerbla( "LAPACKE_zgesvdx_work", info );
78  return info;
79  }
80  if( ldvt < ncols_vt ) {
81  info = -18;
82  LAPACKE_xerbla( "LAPACKE_zgesvdx_work", info );
83  return info;
84  }
85  /* Query optimal working array(s) size if requested */
86  if( lwork == -1 ) {
87  LAPACK_zgesvdx( &jobu, &jobvt, &range, &m, &n, a, &lda_t, &vl, &vu,
88  &il, &iu, ns, s, u, &ldu_t, vt,
89  &ldvt_t, work, &lwork, rwork, iwork, &info );
90  return (info < 0) ? (info - 1) : info;
91  }
92  /* Allocate memory for temporary array(s) */
93  a_t = (lapack_complex_double*)
94  LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
95  if( a_t == NULL ) {
96  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
97  goto exit_level_0;
98  }
99  if( LAPACKE_lsame( jobu, 'v' ) ) {
100  u_t = (lapack_complex_double*)
101  LAPACKE_malloc( sizeof(lapack_complex_double) * ldu_t * MAX(1,ncols_u) );
102  if( u_t == NULL ) {
103  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
104  goto exit_level_1;
105  }
106  }
107  if( LAPACKE_lsame( jobvt, 'v' ) ) {
108  vt_t = (lapack_complex_double*)
109  LAPACKE_malloc( sizeof(lapack_complex_double) * ldvt_t * MAX(1,n) );
110  if( vt_t == NULL ) {
111  info = LAPACK_TRANSPOSE_MEMORY_ERROR;
112  goto exit_level_2;
113  }
114  }
115  /* Transpose input matrices */
116  LAPACKE_zge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
117  /* Call LAPACK function and adjust info */
118  LAPACK_zgesvdx( &jobu, &jobvt, &range, &m, &n, a_t, &lda_t, &vl, &vu,
119  &il, &iu, ns, s, u_t, &ldu_t, vt_t,
120  &ldvt_t, work, &lwork, rwork, iwork, &info );
121  if( info < 0 ) {
122  info = info - 1;
123  }
124  /* Transpose output matrices */
125  LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
126  if( LAPACKE_lsame( jobu, 'v' ) ) {
127  LAPACKE_zge_trans( LAPACK_COL_MAJOR, nrows_u, ncols_u, u_t, ldu_t,
128  u, ldu );
129  }
130  if( LAPACKE_lsame( jobvt, 'v' ) ) {
131  LAPACKE_zge_trans( LAPACK_COL_MAJOR, nrows_vt, n, vt_t, ldvt_t, vt,
132  ldvt );
133  }
134  /* Release memory and exit */
135  if( LAPACKE_lsame( jobvt, 'v' ) ) {
136  LAPACKE_free( vt_t );
137  }
138 exit_level_2:
139  if( LAPACKE_lsame( jobu, 'v' ) ) {
140  LAPACKE_free( u_t );
141  }
142 exit_level_1:
143  LAPACKE_free( a_t );
144 exit_level_0:
145  if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
146  LAPACKE_xerbla( "LAPACKE_zgesvdx_work", info );
147  }
148  } else {
149  info = -1;
150  LAPACKE_xerbla( "LAPACKE_zgesvdx_work", info );
151  }
152  return info;
153 }
LAPACKE_free
#define LAPACKE_free(p)
Definition: lapacke.h:47
lapack_int
#define lapack_int
Definition: lapack.h:21
lapacke_utils.h
LAPACK_zgesvdx
void LAPACK_zgesvdx(char const *jobu, char const *jobvt, char const *range, lapack_int const *m, lapack_int const *n, lapack_complex_double *A, lapack_int const *lda, double const *vl, double const *vu, lapack_int const *il, lapack_int const *iu, lapack_int *ns, double *S, lapack_complex_double *U, lapack_int const *ldu, lapack_complex_double *VT, lapack_int const *ldvt, lapack_complex_double *work, lapack_int const *lwork, double *rwork, lapack_int *iwork, lapack_int *info)
MIN
#define MIN(x, y)
Definition: lapacke_utils.h:50
LAPACKE_xerbla
void LAPACKE_xerbla(const char *name, lapack_int info)
Definition: lapacke_xerbla.c:36
MAX
#define MAX(x, y)
Definition: lapacke_utils.h:47
LAPACK_TRANSPOSE_MEMORY_ERROR
#define LAPACK_TRANSPOSE_MEMORY_ERROR
Definition: lapacke.h:57
lapack_complex_double
#define lapack_complex_double
Definition: lapack.h:70
LAPACKE_zgesvdx_work
lapack_int LAPACKE_zgesvdx_work(int matrix_layout, char jobu, char jobvt, char range, lapack_int m, lapack_int n, lapack_complex_double *a, lapack_int lda, double vl, double vu, lapack_int il, lapack_int iu, lapack_int *ns, double *s, lapack_complex_double *u, lapack_int ldu, lapack_complex_double *vt, lapack_int ldvt, lapack_complex_double *work, lapack_int lwork, double *rwork, lapack_int *iwork)
Definition: lapacke_zgesvdx_work.c:35
LAPACKE_malloc
#define LAPACKE_malloc(size)
Definition: lapacke.h:44
LAPACKE_lsame
lapack_logical LAPACKE_lsame(char ca, char cb)
Definition: lapacke_lsame.c:35
LAPACK_ROW_MAJOR
#define LAPACK_ROW_MAJOR
Definition: lapacke.h:53
LAPACK_COL_MAJOR
#define LAPACK_COL_MAJOR
Definition: lapacke.h:54
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