53 #define printfRootInternal(...) { if( hit_Rank == 0 ) { printf(__VA_ARGS__); fflush(stdout); }}
54 #define printfRoot(...) printfRootInternal(__VA_ARGS__)
166 printf(
"%.2lf\t",m.
m[i][j]);
180 printf(
"%.2lf\t",v.
v[i]);
190 #define clearV(vv) clearVInternal((vv).v)
191 #define clearVInternal(v) \
192 ((v)[0] = (v)[1] = (v)[2] = 0.0 )
197 #define cpyV(r,a) cpyVInternal((r).v,(a).v)
198 #define cpyVInternal(r,a) \
199 {(r)[0] = (a)[0]; (r)[1] = (a)[1]; (r)[2] = (a)[2]; }
204 #define addV(r,a,b) addVInternal((r).v,(a).v,(b).v)
205 #define addVInternal(r,a,b) \
206 {(r)[0] = (a)[0] + (b)[0]; (r)[1] = (a)[1] + (b)[1]; (r)[2] = (a)[2] + (b)[2]; }
212 #define subV(r,a,b) subVInternal((r).v,(a).v,(b).v)
213 #define subVInternal(r,a,b) \
214 {(r)[0] = (a)[0] - (b)[0]; (r)[1] = (a)[1] - (b)[1]; (r)[2] = (a)[2] - (b)[2]; }
219 #define norm(vv) normInternal((vv).v)
220 #define normInternal(v) \
221 (sqrt( pow((v)[0],2) + pow((v)[1],2) + pow((v)[2],2) ))
226 #define multSV(r,s,vv) multSVInternal((r).v,s,(vv).v)
227 #define multSVInternal(r,s,v) \
228 {(r)[0] = (s) * (v)[0]; (r)[1] = (s) * (v)[1]; (r)[2] = (s) * (v)[2]; }
233 #define clearM(mm) clearMInternal((mm).m)
234 #define clearMInternal(m) \
235 ((m)[0][0] = (m)[0][1] = (m)[0][2] = \
236 (m)[1][0] = (m)[1][1] = (m)[1][2] = \
237 (m)[2][0] = (m)[2][1] = (m)[2][2] = 0.0 )
249 #define det(mm) detInternal((mm).m)
250 #define detInternal(m) \
251 ( (m)[0][0] * (m)[1][1] * (m)[2][2] \
252 + (m)[0][1] * (m)[1][2] * (m)[2][0] \
253 + (m)[0][2] * (m)[1][0] * (m)[2][1] \
254 - (m)[0][0] * (m)[1][2] * (m)[2][1] \
255 - (m)[0][1] * (m)[1][0] * (m)[2][2] \
256 - (m)[0][2] * (m)[1][1] * (m)[2][0] )
261 #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)
262 #define init_matrixInternal(m,a,b,c,d,e,f,g,h,i) \
263 {(m)[0][0] = a; (m)[0][1] = b; (m)[0][2] = c; \
264 (m)[1][0] = d; (m)[1][1] = e; (m)[1][2] = f; \
265 (m)[2][0] = g; (m)[2][1] = h; (m)[2][2] = i; }
270 #define multSM(r,s,mm) multSMInternal((r).m,s,(mm).m)
271 #define multSMInternal(r,s,m) \
272 {(r)[0][0] = (s) * (m)[0][0]; (r)[0][1] = (s) * (m)[0][1]; (r)[0][2] = (s) * (m)[0][2]; \
273 (r)[1][0] = (s) * (m)[1][0]; (r)[1][1] = (s) * (m)[1][1]; (r)[1][2] = (s) * (m)[1][2]; \
274 (r)[2][0] = (s) * (m)[2][0]; (r)[2][1] = (s) * (m)[2][1]; (r)[2][2] = (s) * (m)[2][2]; }
279 #define multSI(r,s) multSIInternal((r).m,s)
280 #define multSIInternal(r,s) \
281 {(r)[0][0] = (s); (r)[0][1] = 0; (r)[0][2] = 0; \
282 (r)[1][0] = 0; (r)[1][1] = (s); (r)[1][2] = 0; \
283 (r)[2][0] = 0; (r)[2][1] = 0; (r)[2][2] = (s); }
289 #define addM(r,a,b) addMInternal((r).m,(a).m,(b).m)
290 #define addMInternal(r,a,b) \
291 {(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]; \
292 (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]; \
293 (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]; }
299 #define multVVt(r,a,b) multVVtInternal((r).m,(a).v,(b).v)
300 #define multVVtInternal(r,a,b) \
301 {(r)[0][0] = (a)[0] * (b)[0]; (r)[0][1] = (a)[0] * (b)[1]; (r)[0][2] = (a)[0] * (b)[2]; \
302 (r)[1][0] = (a)[1] * (b)[0]; (r)[1][1] = (a)[1] * (b)[1]; (r)[1][2] = (a)[1] * (b)[2]; \
303 (r)[2][0] = (a)[2] * (b)[0]; (r)[2][1] = (a)[2] * (b)[1]; (r)[2][2] = (a)[2] * (b)[2]; }
309 #define multMV(r,mm,vv) multMVInternal((r).v,(mm).m,(vv).v)
310 #define multMVInternal(r,m,v) \
311 {(r)[0] = (m)[0][0] * (v)[0] + (m)[0][1] * (v)[1] + (m)[0][2] * (v)[2]; \
312 (r)[1] = (m)[1][0] * (v)[0] + (m)[1][1] * (v)[1] + (m)[1][2] * (v)[2]; \
313 (r)[2] = (m)[2][0] * (v)[0] + (m)[2][1] * (v)[1] + (m)[2][2] * (v)[2]; }
319 #define inv(r,mm) invInternal((r).m,(mm).m)
320 #define invInternal(r,m) \
321 {(r)[0][0] = (m)[1][1] * (m)[2][2] - (m)[1][2] * (m)[2][1]; \
322 (r)[0][1] = - (m)[0][1] * (m)[2][2] + (m)[0][2] * (m)[2][1]; \
323 (r)[0][2] = (m)[0][1] * (m)[1][2] - (m)[0][2] * (m)[1][1]; \
324 (r)[1][0] = - (m)[1][0] * (m)[2][2] + (m)[1][2] * (m)[2][0]; \
325 (r)[1][1] = (m)[0][0] * (m)[2][2] - (m)[0][2] * (m)[2][0]; \
326 (r)[1][2] = - (m)[0][0] * (m)[1][2] + (m)[0][2] * (m)[1][0]; \
327 (r)[2][0] = (m)[1][0] * (m)[2][1] - (m)[1][1] * (m)[2][0]; \
328 (r)[2][1] = - (m)[0][0] * (m)[2][1] + (m)[0][1] * (m)[2][0]; \
329 (r)[2][2] = (m)[0][0] * (m)[1][1] - (m)[0][1] * (m)[1][0]; \
330 multSMInternal(r,1/detInternal(m),r); }
335 #define multMM(r,a,b) multMMInternal((r).m,(a).m,(b).m)
336 #define multMMInternal(r,a,b) \
337 {(r)[0][0] = (a)[0][0] * (b)[0][0] + (a)[0][1] * (b)[1][0] + (a)[0][2] * (b)[2][0]; \
338 (r)[0][1] = (a)[0][0] * (b)[0][1] + (a)[0][1] * (b)[1][1] + (a)[0][2] * (b)[2][1]; \
339 (r)[0][2] = (a)[0][0] * (b)[0][2] + (a)[0][1] * (b)[1][2] + (a)[0][2] * (b)[2][2]; \
340 (r)[1][0] = (a)[1][0] * (b)[0][0] + (a)[1][1] * (b)[1][0] + (a)[1][2] * (b)[2][0]; \
341 (r)[1][1] = (a)[1][0] * (b)[0][1] + (a)[1][1] * (b)[1][1] + (a)[1][2] * (b)[2][1]; \
342 (r)[1][2] = (a)[1][0] * (b)[0][2] + (a)[1][1] * (b)[1][2] + (a)[1][2] * (b)[2][2]; \
343 (r)[2][0] = (a)[2][0] * (b)[0][0] + (a)[2][1] * (b)[1][0] + (a)[2][2] * (b)[2][0]; \
344 (r)[2][1] = (a)[2][0] * (b)[0][1] + (a)[2][1] * (b)[1][1] + (a)[2][2] * (b)[2][1]; \
345 (r)[2][2] = (a)[2][0] * (b)[0][2] + (a)[2][1] * (b)[1][2] + (a)[2][2] * (b)[2][2]; }
373 for(iter=0; iter<
ITER_SJ; iter++){
376 if( A.
m[i][i] == 0 )
continue;
381 if(i != j) x_1.
v[i] += A.
m[i][j] * x.
v[j];
383 x_1.
v[i] = (b.
v[i] - x_1.
v[i]) / A.
m[i][i];
407 double detA =
det(A);
463 printf(
"%s [-n NEWTON METHOD ITERATIONS] [-j JACOBI METHOD ITERATIONS] FILE \n",name);
465 printf(
" -n NEWTON METHOD ITERATIONS number of iterations (default 10)\n");
466 printf(
" -j JACOBI METHOD ITERATIONS number of iterations (default 100)\n");
467 printf(
" FILE input graph file\n");
483 if(!(p = strstr(str, orig)))
return NULL;
485 strncpy(buffer, str, (
size_t) (p-str));
486 buffer[p-str] =
'\0';
488 sprintf(buffer+(p-str),
"%s%s", rep, p+strlen(orig));
511 double number = (double) random();
519 if ((random() % 100) <
P_FIXED){
547 while ((c = (
char) getopt (argc, argv,
"hn:j:")) != -1)
550 sscanf(optarg,
"%d",&
iter1);
553 sscanf(optarg,
"%d",&
iter2);
567 char * graph_file = argv[optind];
590 printf(
"# N fixed: %d\n",nfixed);
634 Vector v4 = {{0,100,200}};
636 Vector v5 = {{100,100,0}};
638 Vector v6 = {{200,100,0}};
640 Vector v7 = {{300,100,0}};
664 HitTile_double
norm, sum_norm;
717 int main(
int argc,
char ** argv) {
732 lay =
hit_layout(plug_layBitmap,topo,&global_shape);
765 for(i=0;i<
iter1;i++){
781 for(j=0;j<
iter2;j++){
814 printfRoot(
"# Final gradient norm: %lf\n",gnorm);
865 double scalar = -
K * ((
L - n) / n);
891 double scalar_a, scalar_b;
904 scalar_a = -((
L-n)/(n));
906 scalar_b = (
L/(pow(n,3)));
937 Vector gij =
g(vertex,nghb_index);
941 Matrix Wij =
W(vertex,nghb_index);
947 Matrix Hij =
W(nghb_index,vertex);
978 if(nghb_index == vertex)
continue;
void print_help(char *name)
#define hit_bShapeEdgeTargetSkip(s, edge)
#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,...)
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)
#define hit_bShapeEdgeIteratorSkip(var, shape, vertex)
void hit_gbTileClearVertices(void *varP)
#define hit_tileDomainAlloc(newVarP, baseType, numDims,...)
void solve_system_iter(int vertex)
#define hit_topology(name,...)
#define hit_gbTileEdgeIteratorSkipAt(var, vertex, edge_index)
#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)
#define multMV(r, mm, vv)
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 hit_layout(name, topo,...)
#define hit_tileFree(var)
#define hit_clockGetSeconds(c)
#define hit_gbTileDomainShapeAlloc(var, baseType, shape, allocOpts)
#define hit_clockStart(c)