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
|
#! /bin/bash -e
# SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
# SPDX-FileCopyrightText: Bradley M. Bell <bradbell@seanet.com>
# SPDX-FileContributor: 2003-22 Bradley M. Bell
# ----------------------------------------------------------------------------
if [ "$1" != 'forward' ] && [ "$1" != 'reverse' ]
then
echo 'usage: ./colpack.sh option'
echo 'where option is "forward" or "reverse"'
exit 1
fi
if [ "$1" == 'forward' ]
then
color_variant="COLUMN_PARTIAL_DISTANCE_TWO"
else
color_variant="ROW_PARTIAL_DISTANCE_TWO"
fi
# ----------------------------------------------------------------------------
# bash function that echos and executes a command
echo_eval() {
echo $*
eval $*
}
# -----------------------------------------------
if [ ! -e 'build/colpack' ]
then
echo_eval mkdir -p build/colpack
fi
echo 'create: build/colpack/colpack.cpp'
cat<< EOF > build/colpack/colpack.cpp
// Example using BipartiteGraphPartialColoringInterface
// to generate the seed matrix for Jacobian
#include "ColPackHeaders.h"
int main()
{ size_t i, j, k;
using std::cout;
using std::endl;
//* 32x9 matrix
size_t i_RowCount = 32;
size_t i_ColumnCount = 9;
size_t i_MaxNonZerosInRows = 3;
// JP[32][9]
std::vector<unsigned int *> JP(i_RowCount);
unsigned int n_data = i_RowCount * (i_MaxNonZerosInRows + 1);
std::vector<unsigned int> JP_memory(n_data);
for(i = 0; i < i_RowCount; i++)
JP[i] = JP_memory.data() + i * (i_MaxNonZerosInRows + 1);
//
JP[0][0] = 0;
JP[1][0] = 1; JP[1][1] = 0;
JP[2][0] = 1; JP[2][1] = 1;
JP[3][0] = 1; JP[3][1] = 2;
JP[4][0] = 1; JP[4][1] = 0;
JP[5][0] = 3; JP[5][1] = 0; JP[5][2] = 1; JP[5][3] = 3;
JP[6][0] = 3; JP[6][1] = 1; JP[6][2] = 2; JP[6][3] = 4;
JP[7][0] = 2; JP[7][1] = 2; JP[7][2] = 5;
JP[8][0] = 1; JP[8][1] = 3;
JP[9][0] = 3; JP[9][1] = 3; JP[9][2] = 4; JP[9][3] = 6;
JP[10][0] = 3; JP[10][1] = 4; JP[10][2] = 5; JP[10][3] = 7;
JP[11][0] = 2; JP[11][1] = 5; JP[11][2] = 8;
JP[12][0] = 1; JP[12][1] = 6;
JP[13][0] = 2; JP[13][1] = 6; JP[13][2] = 7;
JP[14][0] = 2; JP[14][1] = 7; JP[14][2] = 8;
JP[15][0] = 1; JP[15][1] = 8;
JP[16][0] = 1; JP[16][1] = 0;
JP[17][0] = 2; JP[17][1] = 0; JP[17][2] = 1;
JP[18][0] = 2; JP[18][1] = 1; JP[18][2] = 2;
JP[19][0] = 1; JP[19][1] = 2;
JP[20][0] = 2; JP[20][1] = 0; JP[20][2] = 3;
JP[21][0] = 3; JP[21][1] = 1; JP[21][2] = 3; JP[21][3] = 4;
JP[22][0] = 3; JP[22][1] = 2; JP[22][2] = 4; JP[22][3] = 5;
JP[23][0] = 1; JP[23][1] = 5;
JP[24][0] = 2; JP[24][1] = 3; JP[24][2] = 6;
JP[25][0] = 3; JP[25][1] = 4; JP[25][2] = 6; JP[25][3] = 7;
JP[26][0] = 3; JP[26][1] = 5; JP[26][2] = 7; JP[26][3] = 8;
JP[27][0] = 1; JP[27][1] = 8;
JP[28][0] = 1; JP[28][1] = 6;
JP[29][0] = 1; JP[29][1] = 7;
JP[30][0] = 1; JP[30][1] = 8;
JP[31][0] = 0;
cout << endl << "Sparsity pattern of Jacobian:" << endl;
cout << " ";
for(k = 0; k < 9; k++)
cout << setw(3) << k;
cout << endl;
for(i = 0; i < i_RowCount; i++)
{ cout << setw(3) << i << ":";
k = 0;
for (j = 1; j <= (int) JP[i][0]; j++)
{ while(k < JP[i][j])
{ cout << setw(3) << 0;
k++;
}
cout << setw(3) << 1;
k++;
}
while(k < 9)
{ cout << setw(3) << 0;
k++;
}
cout << endl;
}
// Step 1: Read the sparsity pattern of the given Jacobian matrix
// (adolc format) and create the corresponding bipartite graph
ColPack::BipartiteGraphPartialColoringInterface g(
SRC_MEM_ADOLC, JP.data(), i_RowCount, i_ColumnCount
);
g.PrintBipartiteGraph();
// Step 2: Do Partial-Distance-Two-Coloring
// of the bipartite graph with the specified ordering
g.PartialDistanceTwoColoring(
"SMALLEST_LAST", "$color_variant"
);
g.PrintColumnPartialColors();
g.PrintColumnPartialColoringMetrics();
// Step 3: From the coloring information, create and return seed matrix
int ip1_SeedRowCount;
int ip1_SeedColumnCount;
double** RSeed =
g.GetSeedMatrix(&ip1_SeedRowCount, &ip1_SeedColumnCount);
int rows = ip1_SeedRowCount;
int cols = ip1_SeedColumnCount;
cout << "Seed matrix: (" << rows << "," << cols << ")" << endl;
cout << " ";
for(j = 0; j < cols; j++)
cout << setw(3) << j;
cout << endl;
for(i = 0; i < rows; i++)
{ cout << setw(3) << i << ":";
for(j = 0; j < cols; j++)
cout << setw(3) << int(RSeed[i][j]);
cout << endl;
}
return 0;
}
EOF
# ----------------------------------------------------------------------------
echo_eval cd build/colpack
echo_eval g++ colpack.cpp \
-I$HOME/prefix/colpack/include/ColPack \
-L$HOME/prefix/colpack/lib64 \
-l ColPack \
-o colpack
#
echo_eval valgrind --leak-check=yes ./colpack
# ----------------------------------------------------------------------------
echo "$0: OK"
exit 0
|
