Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
/**
*
* @copyright (c) 2009-2014 The University of Tennessee and The University
* of Tennessee Research Foundation.
* All rights reserved.
* @copyright (c) 2012-2014 Inria. All rights reserved.
* @copyright (c) 2012-2014 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria, Univ. Bordeaux. All rights reserved.
*
**/
/**
*
* @file testing_zgesvd.c
*
* PLASMA testing routines
* PLASMA is a software package provided by Univ. of Tennessee,
* Univ. of California Berkeley and Univ. of Colorado Denver
*
* @version 2.8.0
* @author Azzam Haidar
* @author Hatem Ltaief
* @date 2010-11-15
* @precisions normal z -> c d s
*
**/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <morse.h>
#include <coreblas/include/cblas.h>
#include <coreblas/include/lapacke.h>
#include <coreblas/include/coreblas.h>
#include "testing_zauxiliary.h"
static int check_orthogonality(int, int, int, MORSE_Complex64_t*, int, double);
static int check_reduction(int, int, double*, MORSE_Complex64_t*, int, MORSE_Complex64_t*, int, MORSE_Complex64_t*, int, double);
static int check_solution(int, double*, double*, double);
int testing_zgesvd(int argc, char **argv)
{
int tree = 0;
if ( argc < 1 ){
goto usage;
} else {
tree = atoi(argv[0]);
}
/* Check for number of arguments*/
if ( ((tree == 0) && (argc != 4)) ||
((tree != 0) && (argc != 5)) ){
usage:
USAGE("GESVD", "MODE M N LDA [RH]",
" - MODE : 0: flat, 1: tree (RH needed)\n"
" - M : number of rows of the matrix A\n"
" - N : number of columns of the matrix A\n"
" - LDA : leading dimension of the matrix A\n"
" - RH : Size of each subdomains\n");
return -1;
}
int M = atoi(argv[1]);
int N = atoi(argv[2]);
int LDA = atoi(argv[3]);
int rh;
if ( tree ) {
rh = atoi(argv[4]);
MORSE_Set(MORSE_HOUSEHOLDER_MODE, MORSE_TREE_HOUSEHOLDER);
MORSE_Set(MORSE_HOUSEHOLDER_SIZE, rh);
}
if (LDA < M){
printf("LDA should be >= M !\n");
return -1;
}
double eps = LAPACKE_dlamch_work('e');
double dmax = 1.0;
MORSE_enum jobu = MorseVec;
MORSE_enum jobvt = MorseVec;
int info_orthou = 0;
int info_orthovt = 0;
int info_solution = 0;
int info_reduction = 0;
int minMN = min(M, N);
int mode = 4;
double rcond = (double) minMN;
int INFO=-1;
MORSE_Complex64_t *A1 = (MORSE_Complex64_t *)malloc(LDA*N*sizeof(MORSE_Complex64_t));
double *S1 = (double *) malloc(minMN*sizeof(double));
double *S2 = (double *) malloc(minMN*sizeof(double));
MORSE_Complex64_t *work = (MORSE_Complex64_t *)malloc(3*max(M, N)* sizeof(MORSE_Complex64_t));
MORSE_Complex64_t *A2 = NULL;
MORSE_Complex64_t *U = NULL;
MORSE_Complex64_t *VT = NULL;
MORSE_desc_t *T;
/* Check if unable to allocate memory */
if ( (!A1) || (!S1) || (!S2) || (!work) ) {
printf("Out of Memory \n ");
return -2;
}
/* TODO: check problem with workspace!!! */
MORSE_Alloc_Workspace_zgesvd(M, N, &T, 1, 1);
/*----------------------------------------------------------
* TESTING ZGESVD
*/
/* Initialize A1 */
LAPACKE_zlatms_work( LAPACK_COL_MAJOR, M, N,
morse_lapack_const(MorseDistUniform), ISEED,
morse_lapack_const(MorseNonsymPosv), S1, mode, rcond,
dmax, M, N,
morse_lapack_const(MorseNoPacking), A1, LDA, work );
free(work);
/* Copy A1 for check */
if ( (jobu == MorseVec) && (jobvt == MorseVec) ) {
A2 = (MORSE_Complex64_t *)malloc(LDA*N*sizeof(MORSE_Complex64_t));
LAPACKE_zlacpy_work(LAPACK_COL_MAJOR, 'A', M, N, A1, LDA, A2, LDA);
}
if ( jobu == MorseVec ) {
U = (MORSE_Complex64_t *)malloc(M*M*sizeof(MORSE_Complex64_t));
LAPACKE_zlaset_work(LAPACK_COL_MAJOR, 'A', M, M, 0., 1., U, M);
}
if ( jobvt == MorseVec ) {
VT = (MORSE_Complex64_t *)malloc(N*N*sizeof(MORSE_Complex64_t));
LAPACKE_zlaset_work(LAPACK_COL_MAJOR, 'A', N, N, 0., 1., VT, N);
}
/* MORSE ZGESVD */
INFO = MORSE_zgesvd(jobu, jobvt, M, N, A1, LDA, S2, T, U, M, VT, N);
if( INFO != 0 ){
printf(" MORSE_zgesvd returned with error code %d\n",INFO);
goto fin;
}
printf("\n");
printf("------ TESTS FOR MORSE ZGESVD ROUTINE ------- \n");
printf(" Size of the Matrix %d by %d\n", M, N);
printf("\n");
printf(" The matrix A is randomly generated for each test.\n");
printf("============\n");
printf(" The relative machine precision (eps) is to be %e \n",eps);
printf(" Computational tests pass if scaled residuals are less than 60.\n");
/* Check the orthogonality, reduction and the singular values */
if ( jobu == MorseVec )
info_orthou = check_orthogonality(MorseLeft, M, M, U, M, eps);
if ( jobvt == MorseVec )
info_orthovt = check_orthogonality(MorseRight, N, N, VT, N, eps);
if ( (jobu == MorseVec) && (jobvt == MorseVec) )
info_reduction = check_reduction(M, N, S2, A2, LDA, U, M, VT, N, eps);
info_solution = check_solution(minMN, S1, S2, eps);
if ( (info_solution == 0) & (info_orthou == 0) &
(info_orthovt == 0) & (info_reduction == 0) ) {
if (M >= N) {
printf("***************************************************\n");
printf(" ---- TESTING ZGESVD .. M >= N ........... PASSED !\n");
printf("***************************************************\n");
}
else {
printf("***************************************************\n");
printf(" ---- TESTING ZGESVD .. M < N ............ PASSED !\n");
printf("***************************************************\n");
}
}
else {
if (M >= N) {
printf("************************************************\n");
printf(" - TESTING ZGESVD .. M >= N .. FAILED !\n");
printf("************************************************\n");
}
else {
printf("************************************************\n");
printf(" - TESTING ZGESVD .. M < N .. FAILED !\n");
printf("************************************************\n");
}
}
fin:
if ( A2 != NULL ) free(A2);
if ( U != NULL ) free(U);
if ( VT != NULL ) free(VT);
free(A1); free(S1); free(S2);
MORSE_Dealloc_Workspace(&T);
return 0;
}
/*-------------------------------------------------------------------
* Check the orthogonality of U VT
*/
static int check_orthogonality(int side, int M, int N, MORSE_Complex64_t *Q, int LDQ, double eps)
{
double done = 1.0;
double mdone = -1.0;
double normQ, result;
int info_ortho;
int minMN = min(M, N);
double *work = (double *)malloc(minMN*sizeof(double));
/* Build the idendity matrix */
MORSE_Complex64_t *Id = (MORSE_Complex64_t *) malloc(minMN*minMN*sizeof(MORSE_Complex64_t));
LAPACKE_zlaset_work(LAPACK_COL_MAJOR, 'A', minMN, minMN, 0., 1., Id, minMN);
/* Perform Id - Q'Q */
if (M >= N)
cblas_zherk(CblasColMajor, CblasUpper, CblasConjTrans, N, M, done, Q, LDQ, mdone, Id, N);
else
cblas_zherk(CblasColMajor, CblasUpper, CblasNoTrans, M, N, done, Q, LDQ, mdone, Id, M);
normQ = LAPACKE_zlansy_work(LAPACK_COL_MAJOR, morse_lapack_const(MorseInfNorm), 'U', minMN, Id, minMN, work);
if (getenv("MORSE_TESTING_VERBOSE"))
printf( "||Q||_oo=%e\n", normQ );
result = normQ / (M * eps);
if (side == MorseLeft)
{
printf(" ======================================================\n");
printf(" ||Id-U'*U||_oo / (M*eps) : %e \n", result );
printf(" ======================================================\n");
}
else
{
printf(" ======================================================\n");
printf(" ||Id-VT'*VT||_oo / (M*eps) : %e \n", result );
printf(" ======================================================\n");
}
if ( isnan(result) || isinf(result) || (result > 60.0) ) {
printf("-- Orthogonality is suspicious ! \n");
info_ortho = 1;
}
else {
printf("-- Orthogonality is CORRECT ! \n");
info_ortho = 0;
}
free(work); free(Id);
return info_ortho;
}
/*------------------------------------------------------------
* Check the bidiagonal reduction
*/
static int check_reduction(int M, int N, double *S, MORSE_Complex64_t *A, int LDA,
MORSE_Complex64_t *U, int LDU, MORSE_Complex64_t *VT, int LDVT, double eps )
{
MORSE_Complex64_t zone = 1.0;
MORSE_Complex64_t mzone = -1.0;
double Anorm, Rnorm, result;
int info_reduction;
int i;
int maxMN = max(M, N);
int minMN = min(M, N);
MORSE_Complex64_t *TEMP = (MORSE_Complex64_t *)malloc(minMN*minMN*sizeof(MORSE_Complex64_t));
MORSE_Complex64_t *Residual = (MORSE_Complex64_t *)malloc(M *N *sizeof(MORSE_Complex64_t));
double *work = (double *)malloc(maxMN*sizeof(double));
LAPACKE_zlacpy_work(LAPACK_COL_MAJOR, morse_lapack_const(MorseUpperLower), M, N, A, LDA, Residual, M);
if ( M >= N ) {
/* Compute TEMP = SIGMA * Vt */
LAPACKE_zlacpy_work(LAPACK_COL_MAJOR, 'A', N, N, VT, LDVT, TEMP, N);
for (i = 0; i < minMN; i++){
cblas_zdscal(N, S[i], TEMP + i, N);
}
/* Compute Residual = A - U * (SIGMA * VT) */
cblas_zgemm(CblasColMajor, CblasNoTrans, CblasNoTrans, M, N, N,
CBLAS_SADDR(mzone), U, LDU,
TEMP, minMN,
CBLAS_SADDR(zone), Residual, M);
}
else {
/* Compute TEMP = U * SIGMA */
LAPACKE_zlacpy_work(LAPACK_COL_MAJOR, 'A', M, M, U, LDU, TEMP, M);
for (i = 0; i < minMN; i++){
cblas_zdscal(M, S[i], TEMP + i*M, 1);
}
/* Compute Residual = A - (U * SIGMA) * VT */
cblas_zgemm(CblasColMajor, CblasNoTrans, CblasNoTrans, M, N, M,
CBLAS_SADDR(mzone), TEMP, M,
VT, LDVT,
CBLAS_SADDR(zone), Residual, M);
}
/* Compute the norms */
Rnorm = LAPACKE_zlange_work(LAPACK_COL_MAJOR, morse_lapack_const(MorseOneNorm), M, N, Residual, M, work);
Anorm = LAPACKE_zlange_work(LAPACK_COL_MAJOR, morse_lapack_const(MorseOneNorm), M, N, A, LDA, work);
if (getenv("MORSE_TESTING_VERBOSE"))
printf( "||A||_oo=%e\n||A - U*SIGMA*VT||_oo=%e\n", Anorm, Rnorm );
result = Rnorm / ( Anorm * maxMN * eps);
printf(" ======================================================\n");
printf(" ||A-U*SIGMA*V'||_oo/(||A||_oo.N.eps) : %e \n", result );
printf(" ======================================================\n");
if ( isnan(result) || isinf(result) || (result > 60.0) ) {
printf("-- Reduction is suspicious ! \n");
info_reduction = 1;
}
else {
printf("-- Reduction is CORRECT ! \n");
info_reduction = 0;
}
free(TEMP);
free(Residual);
free(work);
return info_reduction;
}
/*------------------------------------------------------------
* Check the eigenvalues
*/
static int check_solution(int N, double *E1, double *E2, double eps)
{
int info_solution, i;
double resid;
double maxtmp;
double maxel = fabs( fabs(E1[0]) - fabs(E2[0]) );
double maxeig = max( fabs(E1[0]), fabs(E2[0]) );
for (i = 1; i < N; i++){
resid = fabs(fabs(E1[i])-fabs(E2[i]));
maxtmp = max(fabs(E1[i]), fabs(E2[i]));
/* Update */
maxeig = max(maxtmp, maxeig);
maxel = max(resid, maxel );
}
maxel = maxel / (maxeig * N * eps);
printf(" ======================================================\n");
printf(" | S - singularcomputed | / (|S| * N * eps) : %e \n", maxel );
printf(" ======================================================\n");
if ( isnan(maxel) || isinf(maxel) || (maxel > 100) ) {
printf("-- The singular values are suspicious ! \n");
info_solution = 1;
}
else{
printf("-- The singular values are CORRECT ! \n");
info_solution = 0;
}
return info_solution;
}