54 #define printfRootInternal(...) { if( hit_Rank == 0 ) { printf(__VA_ARGS__); fflush(stdout); }}
55 #define printfRoot(...) printfRootInternal(__VA_ARGS__)
167 printf(
"%.2lf\t",m.
m[i][j]);
181 printf(
"%.2lf\t",v.
v[i]);
191 #define clearV(vv) clearVInternal((vv).v)
192 #define clearVInternal(v) \
193 ((v)[0] = (v)[1] = (v)[2] = 0.0 )
198 #define cpyV(r,a) cpyVInternal((r).v,(a).v)
199 #define cpyVInternal(r,a) \
200 {(r)[0] = (a)[0]; (r)[1] = (a)[1]; (r)[2] = (a)[2]; }
205 #define addV(r,a,b) addVInternal((r).v,(a).v,(b).v)
206 #define addVInternal(r,a,b) \
207 {(r)[0] = (a)[0] + (b)[0]; (r)[1] = (a)[1] + (b)[1]; (r)[2] = (a)[2] + (b)[2]; }
213 #define subV(r,a,b) subVInternal((r).v,(a).v,(b).v)
214 #define subVInternal(r,a,b) \
215 {(r)[0] = (a)[0] - (b)[0]; (r)[1] = (a)[1] - (b)[1]; (r)[2] = (a)[2] - (b)[2]; }
220 #define norm(vv) normInternal((vv).v)
221 #define normInternal(v) \
222 (sqrt( pow((v)[0],2) + pow((v)[1],2) + pow((v)[2],2) ))
227 #define multSV(r,s,vv) multSVInternal((r).v,s,(vv).v)
228 #define multSVInternal(r,s,v) \
229 {(r)[0] = (s) * (v)[0]; (r)[1] = (s) * (v)[1]; (r)[2] = (s) * (v)[2]; }
234 #define clearM(mm) clearMInternal((mm).m)
235 #define clearMInternal(m) \
236 ((m)[0][0] = (m)[0][1] = (m)[0][2] = \
237 (m)[1][0] = (m)[1][1] = (m)[1][2] = \
238 (m)[2][0] = (m)[2][1] = (m)[2][2] = 0.0 )
250 #define det(mm) detInternal((mm).m)
251 #define detInternal(m) \
252 ( (m)[0][0] * (m)[1][1] * (m)[2][2] \
253 + (m)[0][1] * (m)[1][2] * (m)[2][0] \
254 + (m)[0][2] * (m)[1][0] * (m)[2][1] \
255 - (m)[0][0] * (m)[1][2] * (m)[2][1] \
256 - (m)[0][1] * (m)[1][0] * (m)[2][2] \
257 - (m)[0][2] * (m)[1][1] * (m)[2][0] )
262 #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)
263 #define init_matrixInternal(m,a,b,c,d,e,f,g,h,i) \
264 {(m)[0][0] = a; (m)[0][1] = b; (m)[0][2] = c; \
265 (m)[1][0] = d; (m)[1][1] = e; (m)[1][2] = f; \
266 (m)[2][0] = g; (m)[2][1] = h; (m)[2][2] = i; }
271 #define multSM(r,s,mm) multSMInternal((r).m,s,(mm).m)
272 #define multSMInternal(r,s,m) \
273 {(r)[0][0] = (s) * (m)[0][0]; (r)[0][1] = (s) * (m)[0][1]; (r)[0][2] = (s) * (m)[0][2]; \
274 (r)[1][0] = (s) * (m)[1][0]; (r)[1][1] = (s) * (m)[1][1]; (r)[1][2] = (s) * (m)[1][2]; \
275 (r)[2][0] = (s) * (m)[2][0]; (r)[2][1] = (s) * (m)[2][1]; (r)[2][2] = (s) * (m)[2][2]; }
280 #define multSI(r,s) multSIInternal((r).m,s)
281 #define multSIInternal(r,s) \
282 {(r)[0][0] = (s); (r)[0][1] = 0; (r)[0][2] = 0; \
283 (r)[1][0] = 0; (r)[1][1] = (s); (r)[1][2] = 0; \
284 (r)[2][0] = 0; (r)[2][1] = 0; (r)[2][2] = (s); }
290 #define addM(r,a,b) addMInternal((r).m,(a).m,(b).m)
291 #define addMInternal(r,a,b) \
292 {(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]; \
293 (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]; \
294 (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]; }
300 #define multVVt(r,a,b) multVVtInternal((r).m,(a).v,(b).v)
301 #define multVVtInternal(r,a,b) \
302 {(r)[0][0] = (a)[0] * (b)[0]; (r)[0][1] = (a)[0] * (b)[1]; (r)[0][2] = (a)[0] * (b)[2]; \
303 (r)[1][0] = (a)[1] * (b)[0]; (r)[1][1] = (a)[1] * (b)[1]; (r)[1][2] = (a)[1] * (b)[2]; \
304 (r)[2][0] = (a)[2] * (b)[0]; (r)[2][1] = (a)[2] * (b)[1]; (r)[2][2] = (a)[2] * (b)[2]; }
310 #define multMV(r,mm,vv) multMVInternal((r).v,(mm).m,(vv).v)
311 #define multMVInternal(r,m,v) \
312 {(r)[0] = (m)[0][0] * (v)[0] + (m)[0][1] * (v)[1] + (m)[0][2] * (v)[2]; \
313 (r)[1] = (m)[1][0] * (v)[0] + (m)[1][1] * (v)[1] + (m)[1][2] * (v)[2]; \
314 (r)[2] = (m)[2][0] * (v)[0] + (m)[2][1] * (v)[1] + (m)[2][2] * (v)[2]; }
320 #define inv(r,mm) invInternal((r).m,(mm).m)
321 #define invInternal(r,m) \
322 {(r)[0][0] = (m)[1][1] * (m)[2][2] - (m)[1][2] * (m)[2][1]; \
323 (r)[0][1] = - (m)[0][1] * (m)[2][2] + (m)[0][2] * (m)[2][1]; \
324 (r)[0][2] = (m)[0][1] * (m)[1][2] - (m)[0][2] * (m)[1][1]; \
325 (r)[1][0] = - (m)[1][0] * (m)[2][2] + (m)[1][2] * (m)[2][0]; \
326 (r)[1][1] = (m)[0][0] * (m)[2][2] - (m)[0][2] * (m)[2][0]; \
327 (r)[1][2] = - (m)[0][0] * (m)[1][2] + (m)[0][2] * (m)[1][0]; \
328 (r)[2][0] = (m)[1][0] * (m)[2][1] - (m)[1][1] * (m)[2][0]; \
329 (r)[2][1] = - (m)[0][0] * (m)[2][1] + (m)[0][1] * (m)[2][0]; \
330 (r)[2][2] = (m)[0][0] * (m)[1][1] - (m)[0][1] * (m)[1][0]; \
331 multSMInternal(r,1/detInternal(m),r); }
336 #define multMM(r,a,b) multMMInternal((r).m,(a).m,(b).m)
337 #define multMMInternal(r,a,b) \
338 {(r)[0][0] = (a)[0][0] * (b)[0][0] + (a)[0][1] * (b)[1][0] + (a)[0][2] * (b)[2][0]; \
339 (r)[0][1] = (a)[0][0] * (b)[0][1] + (a)[0][1] * (b)[1][1] + (a)[0][2] * (b)[2][1]; \
340 (r)[0][2] = (a)[0][0] * (b)[0][2] + (a)[0][1] * (b)[1][2] + (a)[0][2] * (b)[2][2]; \
341 (r)[1][0] = (a)[1][0] * (b)[0][0] + (a)[1][1] * (b)[1][0] + (a)[1][2] * (b)[2][0]; \
342 (r)[1][1] = (a)[1][0] * (b)[0][1] + (a)[1][1] * (b)[1][1] + (a)[1][2] * (b)[2][1]; \
343 (r)[1][2] = (a)[1][0] * (b)[0][2] + (a)[1][1] * (b)[1][2] + (a)[1][2] * (b)[2][2]; \
344 (r)[2][0] = (a)[2][0] * (b)[0][0] + (a)[2][1] * (b)[1][0] + (a)[2][2] * (b)[2][0]; \
345 (r)[2][1] = (a)[2][0] * (b)[0][1] + (a)[2][1] * (b)[1][1] + (a)[2][2] * (b)[2][1]; \
346 (r)[2][2] = (a)[2][0] * (b)[0][2] + (a)[2][1] * (b)[1][2] + (a)[2][2] * (b)[2][2]; }
374 for(iter=0; iter<
ITER_SJ; iter++){
377 if( A.
m[i][i] == 0 )
continue;
382 if(i != j) x_1.
v[i] += A.
m[i][j] * x.
v[j];
384 x_1.
v[i] = (b.
v[i] - x_1.
v[i]) / A.
m[i][i];
408 double detA =
det(A);
464 printf(
"%s [-n NEWTON METHOD ITERATIONS] [-j JACOBI METHOD ITERATIONS] FILE \n",name);
466 printf(
" -n NEWTON METHOD ITERATIONS number of iterations (default 10)\n");
467 printf(
" -j JACOBI METHOD ITERATIONS number of iterations (default 100)\n");
468 printf(
" FILE input graph file\n");
484 if(!(p = strstr(str, orig)))
return NULL;
486 strncpy(buffer, str, (
size_t) (p-str));
487 buffer[p-str] =
'\0';
489 sprintf(buffer+(p-str),
"%s%s", rep, p+strlen(orig));
512 double number = (double) random();
520 if ((random() % 100) <
P_FIXED){
548 while ((c = (
char) getopt (argc, argv,
"hn:j:")) != -1)
551 sscanf(optarg,
"%d",&
iter1);
554 sscanf(optarg,
"%d",&
iter2);
568 char * graph_file = argv[optind];
591 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_laySparseRows,topo,&global_shape);
766 for(i=0;i<
iter1;i++){
782 for(j=0;j<
iter2;j++){
814 printfRoot(
"# Final gradient norm: %lf\n",gnorm);
869 double scalar = -
K * ((
L - n) / n);
895 double scalar_a, scalar_b;
908 scalar_a = -((
L-n)/(n));
910 scalar_b = (
L/(pow(n,3)));
941 Vector gij =
g(vertex,nghb_index);
945 Matrix Wij =
W(vertex,nghb_index);
951 Matrix Hij =
W(nghb_index,vertex);
982 if(nghb_index == vertex)
continue;
#define multMV(r, mm, vv)
void hit_gcTileCopyVertices(void *destP, void *srcP)
void print_help(char *name)
#define hit_layShape(lay)
HitTile_Vector global_graph
#define hit_tileNewType(baseType)
#define hit_cShapeEdgeTarget(s, edge)
HitCom hit_comSparseUpdate(HitLayout lay, const void *tileP, HitType baseType)
void hit_comOpSumDouble(void *, void *, int *, HitType *)
#define hit_cShapeVertexIterator(var, shape)
#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_cShapeEdgeIterator(var, shape, vertex)
#define hit_gcTileEdgeIteratorAt(var, vertex, edge_index)
#define hit_comSparseScatter(lay, tilePSend, tilePRecv, baseType)
#define hit_cShapeCard(shape, dim)
void hit_gcTileClearVertices(void *varP)
Vector solve(Matrix A, Vector b)
#define hit_gcTileDomainShapeAlloc(var, baseType, shape, allocOpts)
#define hit_gcTileVertexAt(var, vertex)
HitShape hit_cShapeExpand(HitShape shape, HitShape original, int amount)
#define hit_cShapeNvertices(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[])
void random_coordinates()
HitShape HIT_CSR_SHAPE_NULL
#define hit_fileHBRead(hbfile)
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_cShapeAddEdge2(shape, x, y)
void calculate_GH(int vertex)
#define hit_layout(name, topo,...)
#define hit_tileFree(var)
#define hit_gcTileEdgeAt(var, pos1, pos2)
#define hit_clockGetSeconds(c)
#define hit_clockStart(c)