-
Notifications
You must be signed in to change notification settings - Fork 0
/
generate_matrix.cpp
141 lines (119 loc) · 4.65 KB
/
generate_matrix.cpp
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
//@HEADER
// ************************************************************************
//
// HPCCG: Simple Conjugate Gradient Benchmark Code
// Copyright (2006) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ************************************************************************
//@HEADER
/////////////////////////////////////////////////////////////////////////
// Routine to read a sparse matrix, right hand side, initial guess,
// and exact solution (as computed by a direct solver).
/////////////////////////////////////////////////////////////////////////
// nrow - number of rows of matrix (on this processor)
#include <iostream>
using std::cout;
using std::cerr;
using std::endl;
#include <cstdlib>
#include <cstdio>
#include <cassert>
#include "generate_matrix.hpp"
void generate_matrix(int nx, int ny, int nz,
HPC_Sparse_Matrix **A, double **x, double **b, double **xexact,
int size, int rank)
{
#ifdef DEBUG
int debug = 1;
#else
int debug = 0;
#endif
int local_nrow = nx*ny*nz; // This is the size of our subblock
assert(local_nrow>0); // Must have something to work with
int local_nnz = 27*local_nrow; // Approximately 27 nonzeros per row (except for boundary nodes)
int total_nrow = local_nrow*size; // Total number of grid points in mesh
long long total_nnz = 27* (long long) total_nrow; // Approximately 27 nonzeros per row (except for boundary nodes)
int start_row = local_nrow*rank; // Each processor gets a section of a chimney stack domain
int stop_row = start_row+local_nrow-1;
// Allocate arrays that are of length local_nrow
int *nnz_in_row = new int[local_nrow];
double **ptr_to_vals_in_row = new double*[local_nrow];
int **ptr_to_inds_in_row = new int *[local_nrow];
double **ptr_to_diags = new double*[local_nrow];
*x = new double[local_nrow];
*b = new double[local_nrow];
*xexact = new double[local_nrow];
// Allocate arrays that are of length local_nnz
double *list_of_vals = new double[local_nnz];
int *list_of_inds = new int [local_nnz];
double * curvalptr = list_of_vals;
int * curindptr = list_of_inds;
long long nnzglobal = 0;
for (int iz=0; iz<nz; iz++)
for (int iy=0; iy<ny; iy++)
for (int ix=0; ix<nx; ix++) {
int curlocalrow = iz*nx*ny+iy*nx+ix;
int currow = start_row+iz*nx*ny+iy*nx+ix;
int nnzrow = 0;
ptr_to_vals_in_row[curlocalrow] = curvalptr;
ptr_to_inds_in_row[curlocalrow] = curindptr;
for (int sz=-1; sz<=1; sz++)
for (int sy=-1; sy<=1; sy++)
for (int sx=-1; sx<=1; sx++) {
int curcol = currow+sz*nx*ny+sy*nx+sx;
if (curcol>=0 && curcol<total_nrow) {
if (curcol==currow) {
ptr_to_diags[curlocalrow] = curvalptr;
*curvalptr++ = 27.0;
}
else
*curvalptr++ = -1.0;
*curindptr++ = curcol;
nnzrow++;
}
}
nnz_in_row[curlocalrow] = nnzrow;
nnzglobal += nnzrow;
(*x)[curlocalrow] = 0.0;
(*b)[curlocalrow] = 27.0 - ((double) (nnzrow-1));
(*xexact)[curlocalrow] = 1.0;
} // end ix loop
if (debug) cout << "Process "<<rank<<" of "<<size<<" has "<<local_nrow;
if (debug) cout << " rows. Global rows "<< start_row
<<" through "<< stop_row <<endl;
if (debug) cout << "Process "<<rank<<" of "<<size
<<" has "<<local_nnz<<" nonzeros."<<endl;
*A = new HPC_Sparse_Matrix; // Allocate matrix struct and fill it
(*A)->title = 0;
(*A)->start_row = start_row ;
(*A)->stop_row = stop_row;
(*A)->total_nrow = total_nrow;
(*A)->total_nnz = total_nnz;
(*A)->local_nrow = local_nrow;
(*A)->local_ncol = local_nrow;
(*A)->local_nnz = local_nnz;
(*A)->nnz_in_row = nnz_in_row;
(*A)->ptr_to_vals_in_row = ptr_to_vals_in_row;
(*A)->ptr_to_inds_in_row = ptr_to_inds_in_row;
(*A)-> ptr_to_diags = ptr_to_diags;
return;
}