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
|
//------------------------------------------------------------------------------
// SLIP_LU/Demo/example2.c: example main program for SLIP_LU
//------------------------------------------------------------------------------
// SLIP_LU: (c) 2019-2020, Chris Lourenco, Jinhao Chen, Erick Moreno-Centeno,
// Timothy A. Davis, Texas A&M University. All Rights Reserved. See
// SLIP_LU/License for the license.
//------------------------------------------------------------------------------
#include "demos.h"
// This example shows how to use SLIP LU within your code
// Unlike example1, the input matrix here is directly read in from the
// triplet formmat. Also, differs from example1 in that the output solution
// is given in mpq_t precision
// usage:
// example2 mat_file rhs_file > out
// mat_file is the Matrix Market file containing the A matrix
// rhs_file is a list of entries for right hand side dense matrix
// if input file names are not specified, they are defaulted to
// ../ExampleMats/10teams.mat and ../ExampleMats/10teams.v, respectively.
// out is file for output calculated result
#define FREE_WORKSPACE \
SLIP_LU_analysis_free(&S, option);\
SLIP_matrix_free(&A, option); \
SLIP_FREE(option); \
SLIP_matrix_free(&b, option); \
SLIP_matrix_free(&x, option); \
SLIP_finalize();
int main (int argc, char **argv)
{
//--------------------------------------------------------------------------
// Prior to using SLIP LU, its environment must be initialized. This is
// done by calling the SLIP_initialize() function.
//--------------------------------------------------------------------------
SLIP_initialize();
//--------------------------------------------------------------------------
// Get matrix and right hand side file names
//--------------------------------------------------------------------------
char *mat_name, *rhs_name;
mat_name = "../ExampleMats/10teams_mat.txt";
rhs_name = "../ExampleMats/10teams_v.txt";
if (argc > 2)
{
mat_name = argv[1];
rhs_name = argv[2];
}
//--------------------------------------------------------------------------
// Declare our data structures
//--------------------------------------------------------------------------
SLIP_info ok;
SLIP_matrix *A = NULL ; // input matrix
SLIP_matrix *b = NULL ; // Right hand side vector
SLIP_matrix *x = NULL ; // Solution vectors
SLIP_LU_analysis *S = NULL ; // Column permutation
SLIP_options *option = SLIP_create_default_options();
if (option == NULL)
{
fprintf (stderr, "Error! OUT of MEMORY!\n");
FREE_WORKSPACE;
return 0;
}
//--------------------------------------------------------------------------
// Allocate memory, read in A and b
//--------------------------------------------------------------------------
// Read in A. The output of this demo function is A in CSC format with
// mpz_t entries.
FILE* mat_file = fopen(mat_name,"r");
if( mat_file == NULL )
{
perror("Error while opening the file");
FREE_WORKSPACE;
return 0;
}
OK(SLIP_tripread(&A, mat_file, option));
fclose(mat_file);
// Read in b. The output of this demo function is b in dense format with
// mpz_t entries
FILE* rhs_file = fopen(rhs_name,"r");
if( rhs_file == NULL )
{
perror("Error while opening the file");
FREE_WORKSPACE;
return 0;
}
OK(SLIP_read_dense(&b, rhs_file, option));
fclose(rhs_file);
// Check if the size of A matches b
if (A->n != b->m)
{
printf("%"PRId64" %"PRId64" \n", A->m,b->m);
fprintf (stderr, "Error! Size of A and b do not match!\n");
FREE_WORKSPACE;
return 0;
}
//--------------------------------------------------------------------------
// solve
//--------------------------------------------------------------------------
clock_t start_s = clock();
// SLIP LU has an optional check, to enable it, one can set the following
// parameter to be true.
option->check = true;
// Solve the system and give MPQ solution
OK(SLIP_backslash( &x, SLIP_MPQ, A, b, option));
clock_t end_s = clock();
double t_s = (double) (end_s - start_s) / CLOCKS_PER_SEC;
printf("\nSLIP LU Factor & Solve time: %lf\n", t_s);
//--------------------------------------------------------------------------
// Free memory
//--------------------------------------------------------------------------
FREE_WORKSPACE;
printf ("\n%s: all tests passed\n\n", __FILE__) ;
return 0;
}
|
