58 #define printfRootInternal(...) { if( hit_Rank == 0 ) { printf(__VA_ARGS__); fflush(stdout); }}
59 #define printfRoot(...) printfRootInternal(__VA_ARGS__)
171 printf(
"%.2lf\t",m.
m[i][j]);
185 printf(
"%.2lf\t",v.
v[i]);
195 #define clearV(vv) clearVInternal((vv).v)
196 #define clearVInternal(v) \
197 ((v)[0] = (v)[1] = (v)[2] = 0.0 )
202 #define cpyV(r,a) cpyVInternal((r).v,(a).v)
203 #define cpyVInternal(r,a) \
204 {(r)[0] = (a)[0]; (r)[1] = (a)[1]; (r)[2] = (a)[2]; }
209 #define addV(r,a,b) addVInternal((r).v,(a).v,(b).v)
210 #define addVInternal(r,a,b) \
211 {(r)[0] = (a)[0] + (b)[0]; (r)[1] = (a)[1] + (b)[1]; (r)[2] = (a)[2] + (b)[2]; }
217 #define subV(r,a,b) subVInternal((r).v,(a).v,(b).v)
218 #define subVInternal(r,a,b) \
219 {(r)[0] = (a)[0] - (b)[0]; (r)[1] = (a)[1] - (b)[1]; (r)[2] = (a)[2] - (b)[2]; }
224 #define norm(vv) normInternal((vv).v)
225 #define normInternal(v) \
226 (sqrt( pow((v)[0],2) + pow((v)[1],2) + pow((v)[2],2) ))
231 #define multSV(r,s,vv) multSVInternal((r).v,s,(vv).v)
232 #define multSVInternal(r,s,v) \
233 {(r)[0] = (s) * (v)[0]; (r)[1] = (s) * (v)[1]; (r)[2] = (s) * (v)[2]; }
238 #define clearM(mm) clearMInternal((mm).m)
239 #define clearMInternal(m) \
240 ((m)[0][0] = (m)[0][1] = (m)[0][2] = \
241 (m)[1][0] = (m)[1][1] = (m)[1][2] = \
242 (m)[2][0] = (m)[2][1] = (m)[2][2] = 0.0 )
254 #define det(mm) detInternal((mm).m)
255 #define detInternal(m) \
256 ( (m)[0][0] * (m)[1][1] * (m)[2][2] \
257 + (m)[0][1] * (m)[1][2] * (m)[2][0] \
258 + (m)[0][2] * (m)[1][0] * (m)[2][1] \
259 - (m)[0][0] * (m)[1][2] * (m)[2][1] \
260 - (m)[0][1] * (m)[1][0] * (m)[2][2] \
261 - (m)[0][2] * (m)[1][1] * (m)[2][0] )
266 #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)
267 #define init_matrixInternal(m,a,b,c,d,e,f,g,h,i) \
268 {(m)[0][0] = a; (m)[0][1] = b; (m)[0][2] = c; \
269 (m)[1][0] = d; (m)[1][1] = e; (m)[1][2] = f; \
270 (m)[2][0] = g; (m)[2][1] = h; (m)[2][2] = i; }
275 #define multSM(r,s,mm) multSMInternal((r).m,s,(mm).m)
276 #define multSMInternal(r,s,m) \
277 {(r)[0][0] = (s) * (m)[0][0]; (r)[0][1] = (s) * (m)[0][1]; (r)[0][2] = (s) * (m)[0][2]; \
278 (r)[1][0] = (s) * (m)[1][0]; (r)[1][1] = (s) * (m)[1][1]; (r)[1][2] = (s) * (m)[1][2]; \
279 (r)[2][0] = (s) * (m)[2][0]; (r)[2][1] = (s) * (m)[2][1]; (r)[2][2] = (s) * (m)[2][2]; }
284 #define multSI(r,s) multSIInternal((r).m,s)
285 #define multSIInternal(r,s) \
286 {(r)[0][0] = (s); (r)[0][1] = 0; (r)[0][2] = 0; \
287 (r)[1][0] = 0; (r)[1][1] = (s); (r)[1][2] = 0; \
288 (r)[2][0] = 0; (r)[2][1] = 0; (r)[2][2] = (s); }
294 #define addM(r,a,b) addMInternal((r).m,(a).m,(b).m)
295 #define addMInternal(r,a,b) \
296 {(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]; \
297 (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]; \
298 (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]; }
304 #define multVVt(r,a,b) multVVtInternal((r).m,(a).v,(b).v)
305 #define multVVtInternal(r,a,b) \
306 {(r)[0][0] = (a)[0] * (b)[0]; (r)[0][1] = (a)[0] * (b)[1]; (r)[0][2] = (a)[0] * (b)[2]; \
307 (r)[1][0] = (a)[1] * (b)[0]; (r)[1][1] = (a)[1] * (b)[1]; (r)[1][2] = (a)[1] * (b)[2]; \
308 (r)[2][0] = (a)[2] * (b)[0]; (r)[2][1] = (a)[2] * (b)[1]; (r)[2][2] = (a)[2] * (b)[2]; }
314 #define multMV(r,mm,vv) multMVInternal((r).v,(mm).m,(vv).v)
315 #define multMVInternal(r,m,v) \
316 {(r)[0] = (m)[0][0] * (v)[0] + (m)[0][1] * (v)[1] + (m)[0][2] * (v)[2]; \
317 (r)[1] = (m)[1][0] * (v)[0] + (m)[1][1] * (v)[1] + (m)[1][2] * (v)[2]; \
318 (r)[2] = (m)[2][0] * (v)[0] + (m)[2][1] * (v)[1] + (m)[2][2] * (v)[2]; }
324 #define inv(r,mm) invInternal((r).m,(mm).m)
325 #define invInternal(r,m) \
326 {(r)[0][0] = (m)[1][1] * (m)[2][2] - (m)[1][2] * (m)[2][1]; \
327 (r)[0][1] = - (m)[0][1] * (m)[2][2] + (m)[0][2] * (m)[2][1]; \
328 (r)[0][2] = (m)[0][1] * (m)[1][2] - (m)[0][2] * (m)[1][1]; \
329 (r)[1][0] = - (m)[1][0] * (m)[2][2] + (m)[1][2] * (m)[2][0]; \
330 (r)[1][1] = (m)[0][0] * (m)[2][2] - (m)[0][2] * (m)[2][0]; \
331 (r)[1][2] = - (m)[0][0] * (m)[1][2] + (m)[0][2] * (m)[1][0]; \
332 (r)[2][0] = (m)[1][0] * (m)[2][1] - (m)[1][1] * (m)[2][0]; \
333 (r)[2][1] = - (m)[0][0] * (m)[2][1] + (m)[0][1] * (m)[2][0]; \
334 (r)[2][2] = (m)[0][0] * (m)[1][1] - (m)[0][1] * (m)[1][0]; \
335 multSMInternal(r,1/detInternal(m),r); }
340 #define multMM(r,a,b) multMMInternal((r).m,(a).m,(b).m)
341 #define multMMInternal(r,a,b) \
342 {(r)[0][0] = (a)[0][0] * (b)[0][0] + (a)[0][1] * (b)[1][0] + (a)[0][2] * (b)[2][0]; \
343 (r)[0][1] = (a)[0][0] * (b)[0][1] + (a)[0][1] * (b)[1][1] + (a)[0][2] * (b)[2][1]; \
344 (r)[0][2] = (a)[0][0] * (b)[0][2] + (a)[0][1] * (b)[1][2] + (a)[0][2] * (b)[2][2]; \
345 (r)[1][0] = (a)[1][0] * (b)[0][0] + (a)[1][1] * (b)[1][0] + (a)[1][2] * (b)[2][0]; \
346 (r)[1][1] = (a)[1][0] * (b)[0][1] + (a)[1][1] * (b)[1][1] + (a)[1][2] * (b)[2][1]; \
347 (r)[1][2] = (a)[1][0] * (b)[0][2] + (a)[1][1] * (b)[1][2] + (a)[1][2] * (b)[2][2]; \
348 (r)[2][0] = (a)[2][0] * (b)[0][0] + (a)[2][1] * (b)[1][0] + (a)[2][2] * (b)[2][0]; \
349 (r)[2][1] = (a)[2][0] * (b)[0][1] + (a)[2][1] * (b)[1][1] + (a)[2][2] * (b)[2][1]; \
350 (r)[2][2] = (a)[2][0] * (b)[0][2] + (a)[2][1] * (b)[1][2] + (a)[2][2] * (b)[2][2]; }
378 for(iter=0; iter<
ITER_SJ; iter++){
381 if( A.
m[i][i] == 0 )
continue;
386 if(i != j) x_1.
v[i] += A.
m[i][j] * x.
v[j];
388 x_1.
v[i] = (b.
v[i] - x_1.
v[i]) / A.
m[i][i];
412 double detA =
det(A);
468 printf(
"%s [-n NEWTON METHOD ITERATIONS] [-j JACOBI METHOD ITERATIONS] FILE \n",name);
470 printf(
" -n NEWTON METHOD ITERATIONS number of iterations (default 10)\n");
471 printf(
" -j JACOBI METHOD ITERATIONS number of iterations (default 100)\n");
472 printf(
" FILE input graph file\n");
488 if(!(p = strstr(str, orig)))
return NULL;
490 strncpy(buffer, str, (
size_t) (p-str));
491 buffer[p-str] =
'\0';
493 sprintf(buffer+(p-str),
"%s%s", rep, p+strlen(orig));
516 double number = (double) random();
524 if ((random() % 100) <
P_FIXED){
552 while ((c = (
char) getopt (argc, argv,
"hn:j:")) != -1)
555 sscanf(optarg,
"%d",&
iter1);
558 sscanf(optarg,
"%d",&
iter2);
572 char * graph_file = argv[optind];
595 printf(
"# N fixed: %d\n",nfixed);
639 Vector v4 = {{0,100,200}};
641 Vector v5 = {{100,100,0}};
643 Vector v6 = {{200,100,0}};
645 Vector v7 = {{300,100,0}};
669 HitTile_double
norm, sum_norm;
722 int main(
int argc,
char ** argv) {
737 lay =
hit_layout(plug_layBitmap,topo,&global_shape);
770 for(i=0;i<
iter1;i++){
786 for(j=0;j<
iter2;j++){
819 printfRoot(
"# Final gradient norm: %lf\n",gnorm);
870 double scalar = -
K * ((
L - n) / n);
896 double scalar_a, scalar_b;
909 scalar_a = -((
L-n)/(n));
911 scalar_b = (
L/(pow(n,3)));
942 Vector gij =
g(vertex,nghb_index);
946 Matrix Wij =
W(vertex,nghb_index);
952 Matrix Hij =
W(nghb_index,vertex);
983 if(nghb_index == vertex)
continue;
void print_help(char *name)
#define hit_layShape(lay)
HitTile_Vector global_graph
#define hit_tileNewType(baseType)
#define hit_bShapeAddEdge2(shape, x, y)
HitCom hit_comSparseUpdate(HitLayout lay, const void *tileP, HitType baseType)
void hit_comOpSumDouble(void *, void *, int *, HitType *)
#define hit_fileHBReadBitmap(hbfile)
#define hit_tileElemAt(var, ndims,...)
#define hit_bShapeEdgeTarget(s, edge)
#define hit_bShapeEdgeIterator(var, shape, vertex)
HitShape hit_bShapeExpand(HitShape shape, HitShape original, int amount)
#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)
void hit_gbTileCopyVertices(void *destP, void *srcP)
void hit_gbTileClearVertices(void *varP)
#define hit_tileDomainAlloc(newVarP, baseType, numDims,...)
void solve_system_iter(int vertex)
#define hit_topology(name,...)
#define hit_comSparseScatter(lay, tilePSend, tilePRecv, baseType)
#define hit_gbTileVertexAt(var, vertex)
Vector solve(Matrix A, Vector b)
#define hit_bShapeVertexIterator(var, shape)
void hit_topFree(HitTopology topo)
#define hit_comOp(function, operation)
Vector solve_jacobi(Matrix A, Vector b)
#define hit_clockWorldReduce(c)
void hit_comInit(int *pargc, char **pargv[])
#define hit_bShapeNvertices(shape)
void random_coordinates()
#define hit_gbTileEdgeAt(var, pos1, pos2)
void hit_layFree(HitLayout lay)
int main(int argc, char *argv[])
HitShape HIT_BITMAP_SHAPE_NULL
#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)
void calculate_GH(int vertex)
#define multMV(r, mm, vv)
#define hit_layout(name, topo,...)
#define hit_tileFree(var)
#define hit_clockGetSeconds(c)
#define hit_gbTileDomainShapeAlloc(var, baseType, shape, allocOpts)
#define hit_gbTileEdgeIteratorAt(var, vertex, edge_index)
#define hit_clockStart(c)