57 #define printfRootInternal(...) { if( hit_Rank == 0 ) { printf(__VA_ARGS__); fflush(stdout); }}
58 #define printfRoot(...) printfRootInternal(__VA_ARGS__)
179 printf(
"%.2lf\t",m.
m[i][j]);
193 printf(
"%.2lf\t",v.
v[i]);
203 #define clearV(vv) clearVInternal((vv).v)
204 #define clearVInternal(v) \
205 ((v)[0] = (v)[1] = (v)[2] = 0.0 )
210 #define cpyV(r,a) cpyVInternal((r).v,(a).v)
211 #define cpyVInternal(r,a) \
212 {(r)[0] = (a)[0]; (r)[1] = (a)[1]; (r)[2] = (a)[2]; }
217 #define addV(r,a,b) addVInternal((r).v,(a).v,(b).v)
218 #define addVInternal(r,a,b) \
219 {(r)[0] = (a)[0] + (b)[0]; (r)[1] = (a)[1] + (b)[1]; (r)[2] = (a)[2] + (b)[2]; }
225 #define subV(r,a,b) subVInternal((r).v,(a).v,(b).v)
226 #define subVInternal(r,a,b) \
227 {(r)[0] = (a)[0] - (b)[0]; (r)[1] = (a)[1] - (b)[1]; (r)[2] = (a)[2] - (b)[2]; }
232 #define norm(vv) normInternal((vv).v)
233 #define normInternal(v) \
234 (sqrt( pow((v)[0],2) + pow((v)[1],2) + pow((v)[2],2) ))
239 #define multSV(r,s,vv) multSVInternal((r).v,s,(vv).v)
240 #define multSVInternal(r,s,v) \
241 {(r)[0] = (s) * (v)[0]; (r)[1] = (s) * (v)[1]; (r)[2] = (s) * (v)[2]; }
246 #define clearM(mm) clearMInternal((mm).m)
247 #define clearMInternal(m) \
248 ((m)[0][0] = (m)[0][1] = (m)[0][2] = \
249 (m)[1][0] = (m)[1][1] = (m)[1][2] = \
250 (m)[2][0] = (m)[2][1] = (m)[2][2] = 0.0 )
262 #define det(mm) detInternal((mm).m)
263 #define detInternal(m) \
264 ( (m)[0][0] * (m)[1][1] * (m)[2][2] \
265 + (m)[0][1] * (m)[1][2] * (m)[2][0] \
266 + (m)[0][2] * (m)[1][0] * (m)[2][1] \
267 - (m)[0][0] * (m)[1][2] * (m)[2][1] \
268 - (m)[0][1] * (m)[1][0] * (m)[2][2] \
269 - (m)[0][2] * (m)[1][1] * (m)[2][0] )
274 #define init_matrix(mm,a,b,c,d,e,f,g,h,i) init_matrixInternal((mm).m,a,b,c,d,e,f,g,h,i)
275 #define init_matrixInternal(m,a,b,c,d,e,f,g,h,i) \
276 {(m)[0][0] = a; (m)[0][1] = b; (m)[0][2] = c; \
277 (m)[1][0] = d; (m)[1][1] = e; (m)[1][2] = f; \
278 (m)[2][0] = g; (m)[2][1] = h; (m)[2][2] = i; }
283 #define multSM(r,s,mm) multSMInternal((r).m,s,(mm).m)
284 #define multSMInternal(r,s,m) \
285 {(r)[0][0] = (s) * (m)[0][0]; (r)[0][1] = (s) * (m)[0][1]; (r)[0][2] = (s) * (m)[0][2]; \
286 (r)[1][0] = (s) * (m)[1][0]; (r)[1][1] = (s) * (m)[1][1]; (r)[1][2] = (s) * (m)[1][2]; \
287 (r)[2][0] = (s) * (m)[2][0]; (r)[2][1] = (s) * (m)[2][1]; (r)[2][2] = (s) * (m)[2][2]; }
292 #define multSI(r,s) multSIInternal((r).m,s)
293 #define multSIInternal(r,s) \
294 {(r)[0][0] = (s); (r)[0][1] = 0; (r)[0][2] = 0; \
295 (r)[1][0] = 0; (r)[1][1] = (s); (r)[1][2] = 0; \
296 (r)[2][0] = 0; (r)[2][1] = 0; (r)[2][2] = (s); }
302 #define addM(r,a,b) addMInternal((r).m,(a).m,(b).m)
303 #define addMInternal(r,a,b) \
304 {(r)[0][0] = (a)[0][0] + (b)[0][0]; (r)[0][1] = (a)[0][1] + (b)[0][1]; (r)[0][2] = (a)[0][2] + (b)[0][2]; \
305 (r)[1][0] = (a)[1][0] + (b)[1][0]; (r)[1][1] = (a)[1][1] + (b)[1][1]; (r)[1][2] = (a)[1][2] + (b)[1][2]; \
306 (r)[2][0] = (a)[2][0] + (b)[2][0]; (r)[2][1] = (a)[2][1] + (b)[2][1]; (r)[2][2] = (a)[2][2] + (b)[2][2]; }
312 #define multVVt(r,a,b) multVVtInternal((r).m,(a).v,(b).v)
313 #define multVVtInternal(r,a,b) \
314 {(r)[0][0] = (a)[0] * (b)[0]; (r)[0][1] = (a)[0] * (b)[1]; (r)[0][2] = (a)[0] * (b)[2]; \
315 (r)[1][0] = (a)[1] * (b)[0]; (r)[1][1] = (a)[1] * (b)[1]; (r)[1][2] = (a)[1] * (b)[2]; \
316 (r)[2][0] = (a)[2] * (b)[0]; (r)[2][1] = (a)[2] * (b)[1]; (r)[2][2] = (a)[2] * (b)[2]; }
322 #define multMV(r,mm,vv) multMVInternal((r).v,(mm).m,(vv).v)
323 #define multMVInternal(r,m,v) \
324 {(r)[0] = (m)[0][0] * (v)[0] + (m)[0][1] * (v)[1] + (m)[0][2] * (v)[2]; \
325 (r)[1] = (m)[1][0] * (v)[0] + (m)[1][1] * (v)[1] + (m)[1][2] * (v)[2]; \
326 (r)[2] = (m)[2][0] * (v)[0] + (m)[2][1] * (v)[1] + (m)[2][2] * (v)[2]; }
332 #define inv(r,mm) invInternal((r).m,(mm).m)
333 #define invInternal(r,m) \
334 {(r)[0][0] = (m)[1][1] * (m)[2][2] - (m)[1][2] * (m)[2][1]; \
335 (r)[0][1] = - (m)[0][1] * (m)[2][2] + (m)[0][2] * (m)[2][1]; \
336 (r)[0][2] = (m)[0][1] * (m)[1][2] - (m)[0][2] * (m)[1][1]; \
337 (r)[1][0] = - (m)[1][0] * (m)[2][2] + (m)[1][2] * (m)[2][0]; \
338 (r)[1][1] = (m)[0][0] * (m)[2][2] - (m)[0][2] * (m)[2][0]; \
339 (r)[1][2] = - (m)[0][0] * (m)[1][2] + (m)[0][2] * (m)[1][0]; \
340 (r)[2][0] = (m)[1][0] * (m)[2][1] - (m)[1][1] * (m)[2][0]; \
341 (r)[2][1] = - (m)[0][0] * (m)[2][1] + (m)[0][1] * (m)[2][0]; \
342 (r)[2][2] = (m)[0][0] * (m)[1][1] - (m)[0][1] * (m)[1][0]; \
343 multSMInternal(r,1/detInternal(m),r); }
348 #define multMM(r,a,b) multMMInternal((r).m,(a).m,(b).m)
349 #define multMMInternal(r,a,b) \
350 {(r)[0][0] = (a)[0][0] * (b)[0][0] + (a)[0][1] * (b)[1][0] + (a)[0][2] * (b)[2][0]; \
351 (r)[0][1] = (a)[0][0] * (b)[0][1] + (a)[0][1] * (b)[1][1] + (a)[0][2] * (b)[2][1]; \
352 (r)[0][2] = (a)[0][0] * (b)[0][2] + (a)[0][1] * (b)[1][2] + (a)[0][2] * (b)[2][2]; \
353 (r)[1][0] = (a)[1][0] * (b)[0][0] + (a)[1][1] * (b)[1][0] + (a)[1][2] * (b)[2][0]; \
354 (r)[1][1] = (a)[1][0] * (b)[0][1] + (a)[1][1] * (b)[1][1] + (a)[1][2] * (b)[2][1]; \
355 (r)[1][2] = (a)[1][0] * (b)[0][2] + (a)[1][1] * (b)[1][2] + (a)[1][2] * (b)[2][2]; \
356 (r)[2][0] = (a)[2][0] * (b)[0][0] + (a)[2][1] * (b)[1][0] + (a)[2][2] * (b)[2][0]; \
357 (r)[2][1] = (a)[2][0] * (b)[0][1] + (a)[2][1] * (b)[1][1] + (a)[2][2] * (b)[2][1]; \
358 (r)[2][2] = (a)[2][0] * (b)[0][2] + (a)[2][1] * (b)[1][2] + (a)[2][2] * (b)[2][2]; }
386 for(iter=0; iter<
ITER_SJ; iter++){
389 if( A.
m[i][i] == 0 )
continue;
394 if(i != j) x_1.
v[i] += A.
m[i][j] * x.
v[j];
396 x_1.
v[i] = (b.
v[i] - x_1.
v[i]) / A.
m[i][i];
420 double detA =
det(A);
477 printf(
"%s [-n NEWTON METHOD ITERATIONS] [-j JACOBI METHOD ITERATIONS] FILE \n",name);
479 printf(
" -n NEWTON METHOD ITERATIONS number of iterations (default 10)\n");
480 printf(
" -j JACOBI METHOD ITERATIONS number of iterations (default 100)\n");
481 printf(
" FILE input graph file\n");
499 if(!(p = strstr(str, orig)))
return NULL;
501 strncpy(buffer, str, (
size_t) (p-str));
502 buffer[p-str] =
'\0';
504 sprintf(buffer+(p-str),
"%s%s", rep, p+strlen(orig));
529 double number = (double) random();
540 if ((random() % 100) <
P_FIXED){
635 while ((c = (
char) getopt (argc, argv,
"hn:j:")) != -1)
638 sscanf(optarg,
"%d",&
iter1);
641 sscanf(optarg,
"%d",&
iter2);
655 char * graph_file = argv[optind];
691 char * coord_file =
replace_str(graph_file,
".rb",
"_coord.mtx");
707 printf(
"# N fixed: %d\n",nfixed);
763 global_shape =
hit_shape(1,hit_sig(0,Nvertices-1,1));
767 Node n0 = {{{0,0,0}},1};
769 Node n1 = {{{100,0,0}},0};
771 Node n2 = {{{200,0,0}},0};
773 Node n3 = {{{300,0,0}},1};
775 Node n4 = {{{0,100,200}},1};
777 Node n5 = {{{100,100,0}},0};
779 Node n6 = {{{200,100,0}},0};
781 Node n7 = {{{300,100,0}},1};
797 HitTile_double
norm, sum_norm;
856 int main(
int argc,
char ** argv) {
883 HitTile_int vertices;
906 lay =
hit_layout(plug_layBlocks,topo,global_shape);
955 for(i=0;i<
iter1;i++){
974 for(j=0;j<
iter2;j++){
988 memcpy(
e.data,
new_e.data,
sizeof(
Vector)* (
size_t) Nvertices);
997 if (!current->
fixed){
1009 printfRoot(
"# Final gradient norm: %lf\n",gnorm);
1063 double scalar = -
K * ((
L - n) / n);
1091 double scalar_a, scalar_b;
1104 scalar_a = -((
L-n)/(n));
1106 scalar_b = (
L/(pow(n,3)));
1139 int nghb_index = edge;
1142 Vector gij =
g(vertex,nghb_index);
1146 Matrix Wij =
W(vertex,nghb_index);
1154 Matrix Hij =
W(nghb_index,vertex);
1196 int nghb_index = edge;
1197 if(nghb_index == vertex)
continue;
1201 if(nj.
fixed)
continue;
1222 new_ei =
solve(Hii,sum);
#define hit_shape(nd,...)
void print_help(char *name)
#define hit_layShape(lay)
#define hit_tileNewType(baseType)
void hit_comOpSumDouble(void *, void *, int *, HitType *)
HitCom hit_comBroadcastSelect(HitLayout lay, HitRanks root, const void *tile, HitShape selection, int modeSelect, HitType baseType)
#define hit_tileElemAt(var, ndims,...)
#define HIT_LAYOUT_NULL_STATIC
void hit_comFree(HitCom issue)
char * replace_str(char *str, const char *orig, const char *rep)
void hit_comDo(HitCom *issue)
#define hit_tileDomainAlloc(newVarP, baseType, numDims,...)
void solve_system_iter(int vertex)
#define hit_topology(name,...)
#define hit_layShapeOther(lay, ranks)
#define hit_fileHBVertices(hbfile)
#define HIT_COM_ARRAYCOORDS
#define hit_fileHBReadDense(hbfile, tileP)
#define HIT_PAT_UNORDERED
void hit_patternAdd(HitPattern *pattern, HitCom comm)
Vector solve(Matrix A, Vector b)
#define hit_tileDomainShapeAlloc(newVarP, baseType, shape)
void hit_topFree(HitTopology topo)
#define hit_comOp(function, operation)
#define multMV(r, mm, vv)
Vector solve_jacobi(Matrix A, Vector b)
#define hit_clockWorldReduce(c)
void hit_patternFree(HitPattern *pattern)
void hit_comInit(int *pargc, char **pargv[])
#define hit_layImActive(lay)
void random_coordinates()
void hit_layFree(HitLayout lay)
int main(int argc, char *argv[])
#define hit_comReduce(lay, root, tilePSend, tilePRecv, baseType, operation)
#define hit_comTypeStruct(new_type, Nstruct, n,...)
void init_graph(HitTile_double graph, HitShape shape_global)
#define hit_shapeIterator(var, shape, dim)
int hit_layNumActives(HitLayout lay)
void calculate_GH(int vertex)
#define hit_comBroadcast(lay, root, tile, baseType)
#define hit_layout(name, topo,...)
#define hit_shapeSig(shape, dim)
#define hit_tileFree(var)
#define hit_patternDo(pattern)
#define hit_clockGetSeconds(c)
#define hit_clockStart(c)