LAPACK 3.11.0
LAPACK: Linear Algebra PACKage
Loading...
Searching...
No Matches

◆ LAPACKE_zggsvd_work()

lapack_int LAPACKE_zggsvd_work ( int  matrix_layout,
char  jobu,
char  jobv,
char  jobq,
lapack_int  m,
lapack_int  n,
lapack_int  p,
lapack_int *  k,
lapack_int *  l,
lapack_complex_double *  a,
lapack_int  lda,
lapack_complex_double *  b,
lapack_int  ldb,
double *  alpha,
double *  beta,
lapack_complex_double *  u,
lapack_int  ldu,
lapack_complex_double *  v,
lapack_int  ldv,
lapack_complex_double *  q,
lapack_int  ldq,
lapack_complex_double *  work,
double *  rwork,
lapack_int *  iwork 
)

Definition at line 35 of file lapacke_zggsvd_work.c.

46{
47 lapack_int info = 0;
48 if( matrix_layout == LAPACK_COL_MAJOR ) {
49 /* Call LAPACK function and adjust info */
50 LAPACK_zggsvd( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a, &lda, b, &ldb,
51 alpha, beta, u, &ldu, v, &ldv, q, &ldq, work, rwork,
52 iwork, &info );
53 if( info < 0 ) {
54 info = info - 1;
55 }
56 } else if( matrix_layout == LAPACK_ROW_MAJOR ) {
57 lapack_int lda_t = MAX(1,m);
58 lapack_int ldb_t = MAX(1,p);
59 lapack_int ldq_t = MAX(1,n);
60 lapack_int ldu_t = MAX(1,m);
61 lapack_int ldv_t = MAX(1,p);
62 lapack_complex_double* a_t = NULL;
63 lapack_complex_double* b_t = NULL;
64 lapack_complex_double* u_t = NULL;
65 lapack_complex_double* v_t = NULL;
66 lapack_complex_double* q_t = NULL;
67 /* Check leading dimension(s) */
68 if( lda < n ) {
69 info = -11;
70 LAPACKE_xerbla( "LAPACKE_zggsvd_work", info );
71 return info;
72 }
73 if( ldb < n ) {
74 info = -13;
75 LAPACKE_xerbla( "LAPACKE_zggsvd_work", info );
76 return info;
77 }
78 if( ldq < n ) {
79 info = -21;
80 LAPACKE_xerbla( "LAPACKE_zggsvd_work", info );
81 return info;
82 }
83 if( ldu < m ) {
84 info = -17;
85 LAPACKE_xerbla( "LAPACKE_zggsvd_work", info );
86 return info;
87 }
88 if( ldv < p ) {
89 info = -19;
90 LAPACKE_xerbla( "LAPACKE_zggsvd_work", info );
91 return info;
92 }
93 /* Allocate memory for temporary array(s) */
94 a_t = (lapack_complex_double*)
95 LAPACKE_malloc( sizeof(lapack_complex_double) * lda_t * MAX(1,n) );
96 if( a_t == NULL ) {
97 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
98 goto exit_level_0;
99 }
100 b_t = (lapack_complex_double*)
101 LAPACKE_malloc( sizeof(lapack_complex_double) * ldb_t * MAX(1,n) );
102 if( b_t == NULL ) {
103 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
104 goto exit_level_1;
105 }
106 if( LAPACKE_lsame( jobu, 'u' ) ) {
107 u_t = (lapack_complex_double*)
108 LAPACKE_malloc( sizeof(lapack_complex_double) *
109 ldu_t * MAX(1,m) );
110 if( u_t == NULL ) {
111 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
112 goto exit_level_2;
113 }
114 }
115 if( LAPACKE_lsame( jobv, 'v' ) ) {
116 v_t = (lapack_complex_double*)
117 LAPACKE_malloc( sizeof(lapack_complex_double) *
118 ldv_t * MAX(1,p) );
119 if( v_t == NULL ) {
120 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
121 goto exit_level_3;
122 }
123 }
124 if( LAPACKE_lsame( jobq, 'q' ) ) {
125 q_t = (lapack_complex_double*)
126 LAPACKE_malloc( sizeof(lapack_complex_double) *
127 ldq_t * MAX(1,n) );
128 if( q_t == NULL ) {
129 info = LAPACK_TRANSPOSE_MEMORY_ERROR;
130 goto exit_level_4;
131 }
132 }
133 /* Transpose input matrices */
134 LAPACKE_zge_trans( matrix_layout, m, n, a, lda, a_t, lda_t );
135 LAPACKE_zge_trans( matrix_layout, p, n, b, ldb, b_t, ldb_t );
136 /* Call LAPACK function and adjust info */
137 LAPACK_zggsvd( &jobu, &jobv, &jobq, &m, &n, &p, k, l, a_t, &lda_t, b_t,
138 &ldb_t, alpha, beta, u_t, &ldu_t, v_t, &ldv_t, q_t,
139 &ldq_t, work, rwork, iwork, &info );
140 if( info < 0 ) {
141 info = info - 1;
142 }
143 /* Transpose output matrices */
144 LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, n, a_t, lda_t, a, lda );
145 LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, n, b_t, ldb_t, b, ldb );
146 if( LAPACKE_lsame( jobu, 'u' ) ) {
147 LAPACKE_zge_trans( LAPACK_COL_MAJOR, m, m, u_t, ldu_t, u, ldu );
148 }
149 if( LAPACKE_lsame( jobv, 'v' ) ) {
150 LAPACKE_zge_trans( LAPACK_COL_MAJOR, p, p, v_t, ldv_t, v, ldv );
151 }
152 if( LAPACKE_lsame( jobq, 'q' ) ) {
153 LAPACKE_zge_trans( LAPACK_COL_MAJOR, n, n, q_t, ldq_t, q, ldq );
154 }
155 /* Release memory and exit */
156 if( LAPACKE_lsame( jobq, 'q' ) ) {
157 LAPACKE_free( q_t );
158 }
159exit_level_4:
160 if( LAPACKE_lsame( jobv, 'v' ) ) {
161 LAPACKE_free( v_t );
162 }
163exit_level_3:
164 if( LAPACKE_lsame( jobu, 'u' ) ) {
165 LAPACKE_free( u_t );
166 }
167exit_level_2:
168 LAPACKE_free( b_t );
169exit_level_1:
170 LAPACKE_free( a_t );
171exit_level_0:
172 if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
173 LAPACKE_xerbla( "LAPACKE_zggsvd_work", info );
174 }
175 } else {
176 info = -1;
177 LAPACKE_xerbla( "LAPACKE_zggsvd_work", info );
178 }
179 return info;
180}
LAPACK_zggsvd
#define LAPACK_zggsvd(...)
Definition: lapack.h:5371
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
Here is the call graph for this function:
Here is the caller graph for this function: