55 #define printfRootInternal(...) { if( hit_Rank == 0 ) { printf(__VA_ARGS__); fflush(stdout); }}
56 #define printfRoot(...) printfRootInternal(__VA_ARGS__)
168 printf(
"%.2lf\t",m.
m[i][j]);
182 printf(
"%.2lf\t",v.
v[i]);
192 #define clearV(vv) clearVInternal((vv).v)
193 #define clearVInternal(v) \
194 ((v)[0] = (v)[1] = (v)[2] = 0.0 )
199 #define cpyV(r,a) cpyVInternal((r).v,(a).v)
200 #define cpyVInternal(r,a) \
201 {(r)[0] = (a)[0]; (r)[1] = (a)[1]; (r)[2] = (a)[2]; }
206 #define addV(r,a,b) addVInternal((r).v,(a).v,(b).v)
207 #define addVInternal(r,a,b) \
208 {(r)[0] = (a)[0] + (b)[0]; (r)[1] = (a)[1] + (b)[1]; (r)[2] = (a)[2] + (b)[2]; }
214 #define subV(r,a,b) subVInternal((r).v,(a).v,(b).v)
215 #define subVInternal(r,a,b) \
216 {(r)[0] = (a)[0] - (b)[0]; (r)[1] = (a)[1] - (b)[1]; (r)[2] = (a)[2] - (b)[2]; }
221 #define norm(vv) normInternal((vv).v)
222 #define normInternal(v) \
223 (sqrt( pow((v)[0],2) + pow((v)[1],2) + pow((v)[2],2) ))
228 #define multSV(r,s,vv) multSVInternal((r).v,s,(vv).v)
229 #define multSVInternal(r,s,v) \
230 {(r)[0] = (s) * (v)[0]; (r)[1] = (s) * (v)[1]; (r)[2] = (s) * (v)[2]; }
235 #define clearM(mm) clearMInternal((mm).m)
236 #define clearMInternal(m) \
237 ((m)[0][0] = (m)[0][1] = (m)[0][2] = \
238 (m)[1][0] = (m)[1][1] = (m)[1][2] = \
239 (m)[2][0] = (m)[2][1] = (m)[2][2] = 0.0 )
251 #define det(mm) detInternal((mm).m)
252 #define detInternal(m) \
253 ( (m)[0][0] * (m)[1][1] * (m)[2][2] \
254 + (m)[0][1] * (m)[1][2] * (m)[2][0] \
255 + (m)[0][2] * (m)[1][0] * (m)[2][1] \
256 - (m)[0][0] * (m)[1][2] * (m)[2][1] \
257 - (m)[0][1] * (m)[1][0] * (m)[2][2] \
258 - (m)[0][2] * (m)[1][1] * (m)[2][0] )
263 #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)
264 #define init_matrixInternal(m,a,b,c,d,e,f,g,h,i) \
265 {(m)[0][0] = a; (m)[0][1] = b; (m)[0][2] = c; \
266 (m)[1][0] = d; (m)[1][1] = e; (m)[1][2] = f; \
267 (m)[2][0] = g; (m)[2][1] = h; (m)[2][2] = i; }
272 #define multSM(r,s,mm) multSMInternal((r).m,s,(mm).m)
273 #define multSMInternal(r,s,m) \
274 {(r)[0][0] = (s) * (m)[0][0]; (r)[0][1] = (s) * (m)[0][1]; (r)[0][2] = (s) * (m)[0][2]; \
275 (r)[1][0] = (s) * (m)[1][0]; (r)[1][1] = (s) * (m)[1][1]; (r)[1][2] = (s) * (m)[1][2]; \
276 (r)[2][0] = (s) * (m)[2][0]; (r)[2][1] = (s) * (m)[2][1]; (r)[2][2] = (s) * (m)[2][2]; }
281 #define multSI(r,s) multSIInternal((r).m,s)
282 #define multSIInternal(r,s) \
283 {(r)[0][0] = (s); (r)[0][1] = 0; (r)[0][2] = 0; \
284 (r)[1][0] = 0; (r)[1][1] = (s); (r)[1][2] = 0; \
285 (r)[2][0] = 0; (r)[2][1] = 0; (r)[2][2] = (s); }
291 #define addM(r,a,b) addMInternal((r).m,(a).m,(b).m)
292 #define addMInternal(r,a,b) \
293 {(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]; \
294 (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]; \
295 (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]; }
301 #define multVVt(r,a,b) multVVtInternal((r).m,(a).v,(b).v)
302 #define multVVtInternal(r,a,b) \
303 {(r)[0][0] = (a)[0] * (b)[0]; (r)[0][1] = (a)[0] * (b)[1]; (r)[0][2] = (a)[0] * (b)[2]; \
304 (r)[1][0] = (a)[1] * (b)[0]; (r)[1][1] = (a)[1] * (b)[1]; (r)[1][2] = (a)[1] * (b)[2]; \
305 (r)[2][0] = (a)[2] * (b)[0]; (r)[2][1] = (a)[2] * (b)[1]; (r)[2][2] = (a)[2] * (b)[2]; }
311 #define multMV(r,mm,vv) multMVInternal((r).v,(mm).m,(vv).v)
312 #define multMVInternal(r,m,v) \
313 {(r)[0] = (m)[0][0] * (v)[0] + (m)[0][1] * (v)[1] + (m)[0][2] * (v)[2]; \
314 (r)[1] = (m)[1][0] * (v)[0] + (m)[1][1] * (v)[1] + (m)[1][2] * (v)[2]; \
315 (r)[2] = (m)[2][0] * (v)[0] + (m)[2][1] * (v)[1] + (m)[2][2] * (v)[2]; }
321 #define inv(r,mm) invInternal((r).m,(mm).m)
322 #define invInternal(r,m) \
323 {(r)[0][0] = (m)[1][1] * (m)[2][2] - (m)[1][2] * (m)[2][1]; \
324 (r)[0][1] = - (m)[0][1] * (m)[2][2] + (m)[0][2] * (m)[2][1]; \
325 (r)[0][2] = (m)[0][1] * (m)[1][2] - (m)[0][2] * (m)[1][1]; \
326 (r)[1][0] = - (m)[1][0] * (m)[2][2] + (m)[1][2] * (m)[2][0]; \
327 (r)[1][1] = (m)[0][0] * (m)[2][2] - (m)[0][2] * (m)[2][0]; \
328 (r)[1][2] = - (m)[0][0] * (m)[1][2] + (m)[0][2] * (m)[1][0]; \
329 (r)[2][0] = (m)[1][0] * (m)[2][1] - (m)[1][1] * (m)[2][0]; \
330 (r)[2][1] = - (m)[0][0] * (m)[2][1] + (m)[0][1] * (m)[2][0]; \
331 (r)[2][2] = (m)[0][0] * (m)[1][1] - (m)[0][1] * (m)[1][0]; \
332 multSMInternal(r,1/detInternal(m),r); }
337 #define multMM(r,a,b) multMMInternal((r).m,(a).m,(b).m)
338 #define multMMInternal(r,a,b) \
339 {(r)[0][0] = (a)[0][0] * (b)[0][0] + (a)[0][1] * (b)[1][0] + (a)[0][2] * (b)[2][0]; \
340 (r)[0][1] = (a)[0][0] * (b)[0][1] + (a)[0][1] * (b)[1][1] + (a)[0][2] * (b)[2][1]; \
341 (r)[0][2] = (a)[0][0] * (b)[0][2] + (a)[0][1] * (b)[1][2] + (a)[0][2] * (b)[2][2]; \
342 (r)[1][0] = (a)[1][0] * (b)[0][0] + (a)[1][1] * (b)[1][0] + (a)[1][2] * (b)[2][0]; \
343 (r)[1][1] = (a)[1][0] * (b)[0][1] + (a)[1][1] * (b)[1][1] + (a)[1][2] * (b)[2][1]; \
344 (r)[1][2] = (a)[1][0] * (b)[0][2] + (a)[1][1] * (b)[1][2] + (a)[1][2] * (b)[2][2]; \
345 (r)[2][0] = (a)[2][0] * (b)[0][0] + (a)[2][1] * (b)[1][0] + (a)[2][2] * (b)[2][0]; \
346 (r)[2][1] = (a)[2][0] * (b)[0][1] + (a)[2][1] * (b)[1][1] + (a)[2][2] * (b)[2][1]; \
347 (r)[2][2] = (a)[2][0] * (b)[0][2] + (a)[2][1] * (b)[1][2] + (a)[2][2] * (b)[2][2]; }
375 for(iter=0; iter<
ITER_SJ; iter++){
378 if( A.
m[i][i] == 0 )
continue;
383 if(i != j) x_1.
v[i] += A.
m[i][j] * x.
v[j];
385 x_1.
v[i] = (b.
v[i] - x_1.
v[i]) / A.
m[i][i];
409 double detA =
det(A);
465 printf(
"%s [-n NEWTON METHOD ITERATIONS] [-j JACOBI METHOD ITERATIONS] FILE \n",name);
467 printf(
" -n NEWTON METHOD ITERATIONS number of iterations (default 10)\n");
468 printf(
" -j JACOBI METHOD ITERATIONS number of iterations (default 100)\n");
469 printf(
" FILE input graph file\n");
485 if(!(p = strstr(str, orig)))
return NULL;
487 strncpy(buffer, str, (
size_t) (p-str));
488 buffer[p-str] =
'\0';
490 sprintf(buffer+(p-str),
"%s%s", rep, p+strlen(orig));
513 double number = (double) random();
521 if ((random() % 100) <
P_FIXED){
549 while ((c = (
char) getopt (argc, argv,
"hn:j:")) != -1)
552 sscanf(optarg,
"%d",&
iter1);
555 sscanf(optarg,
"%d",&
iter2);
569 char * graph_file = argv[optind];
592 printf(
"# N fixed: %d\n",nfixed);
636 Vector v4 = {{0,100,200}};
638 Vector v5 = {{100,100,0}};
640 Vector v6 = {{200,100,0}};
642 Vector v7 = {{300,100,0}};
666 HitTile_double
norm, sum_norm;
719 int main(
int argc,
char ** argv) {
734 lay =
hit_layout(plug_layBitmap,topo,&global_shape);
767 for(i=0;i<
iter1;i++){
783 for(j=0;j<
iter2;j++){
816 printfRoot(
"# Final gradient norm: %lf\n",gnorm);
867 double scalar = -
K * ((
L - n) / n);
893 double scalar_a, scalar_b;
906 scalar_a = -((
L-n)/(n));
908 scalar_b = (
L/(pow(n,3)));
939 Vector gij =
g(vertex,nghb_index);
943 Matrix Wij =
W(vertex,nghb_index);
949 Matrix Hij =
W(nghb_index,vertex);
980 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)
#define hit_bShapeEdgeIteratorDense(var, shape, 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 multMV(r, mm, vv)
#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 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)