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
|
/*
-- MAGMA (version 2.9.0) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
@date January 2025
@generated from sparse/testing/testing_zmatrixcapcup.cpp, normal z -> c, Wed Jan 22 14:42:53 2025
@author Hartwig Anzt
*/
// includes, system
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
// includes, project
#include "magma_v2.h"
#include "magmasparse.h"
#include "magma_operators.h"
#include "testings.h"
/* ////////////////////////////////////////////////////////////////////////////
-- testing any solver
*/
int main( int argc, char** argv )
{
magma_int_t info = 0;
/* Initialize */
TESTING_CHECK( magma_init() );
magma_print_environment();
magma_copts zopts;
magma_queue_t queue=NULL;
magma_queue_create( 0, &queue );
magma_c_matrix Z={Magma_CSR};
magma_c_matrix Z1={Magma_CSR};
magma_c_matrix Z2={Magma_CSR};
magma_c_matrix Z3={Magma_CSR};
magma_c_matrix Z4={Magma_CSR};
magma_c_matrix Z5={Magma_CSR};
int i=1;
TESTING_CHECK( magma_cparse_opts( argc, argv, &zopts, &i, queue ));
printf("matrixinfo = [\n");
printf("%% size (n) || nonzeros (nnz) || nnz/n\n");
printf("%%=============================================================%%\n");
while( i < argc ) {
if ( strcmp("LAPLACE2D", argv[i]) == 0 && i+1 < argc ) { // Laplace test
i++;
magma_int_t laplace_size = atoi( argv[i] );
TESTING_CHECK( magma_cm_5stencil( laplace_size, &Z, queue ));
} else { // file-matrix test
TESTING_CHECK( magma_c_csr_mtx( &Z, argv[i], queue ));
}
printf(" %10lld %10lld %10lld\n",
(long long) Z.num_rows, (long long) Z.nnz, (long long) (Z.nnz/Z.num_rows) );
// multiply by itself
TESTING_CHECK( magma_cmconvert( Z, &Z1, Magma_CSR, Magma_CSRL, queue ));
TESTING_CHECK( magma_cmtranspose( Z1, &Z2, queue ) );
magma_cprint_matrix( Z, queue );
magma_cprint_matrix( Z1, queue );
printf("B = tril(A)^T:\n");
magma_cprint_matrix( Z2, queue );
// now the negcap:
printf("C = B cup B^T :\n");
TESTING_CHECK( magma_cmatrix_cup( Z1, Z2, &Z3, queue ));
magma_cprint_matrix( Z3, queue );
// now the negcap:
printf("C = B cap B^T :\n");
TESTING_CHECK( magma_cmatrix_cap( Z1, Z2, &Z4, queue ));
magma_cprint_matrix( Z4, queue );
// now the negcap:
printf("C = B negcap B^T :\n");
TESTING_CHECK( magma_cmatrix_negcap( Z1, Z2, &Z5, queue ));
magma_cprint_matrix( Z5, queue );
magma_cmfree(&Z, queue );
magma_cmfree(&Z1, queue );
magma_cmfree(&Z2, queue );
magma_cmfree(&Z3, queue );
magma_cmfree(&Z4, queue );
magma_cmfree(&Z5, queue );
i++;
}
printf("%%=============================================================%%\n");
printf("];\n");
magma_queue_destroy( queue );
TESTING_CHECK( magma_finalize() );
return info;
}
|
