CFD/hypre
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Testing for cvs commit quota error.

Browse Source
This commit is contained in:
kolev1 2012-04-23 20:48:45 +00:00
parent 78ae8340d3
commit 953c25420d
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
parcsr_ls/ams.c
View File

@ -3674,7 +3674,7 @@ HYPRE_Int hypre_ParCSRRelaxThreads(hypre_ParCSRMatrix *A,
ns = j*size+rest; ns = j*size+rest;
ne = (j+1)*size+rest; ne = (j+1)*size+rest;
} }
for (i = ns; i < ne; i++) /* interior points first */ for (i = ns; i < ne; i++) /* interior points first */
{ {
/*----------------------------------------------------------- /*-----------------------------------------------------------
* If diagonal is nonzero, relax point i; otherwise, skip it. * If diagonal is nonzero, relax point i; otherwise, skip it.
@ -3701,7 +3701,7 @@ HYPRE_Int hypre_ParCSRRelaxThreads(hypre_ParCSRMatrix *A,
u_data[i] += res / l1_norms[i]; u_data[i] += res / l1_norms[i];
} }
} }
for (i = ne-1; i > ns-1; i--) /* interior points first */ for (i = ne-1; i > ns-1; i--) /* interior points first */
{ {
/*----------------------------------------------------------- /*-----------------------------------------------------------
* If diagonal is nonzero, relax point i; otherwise, skip it. * If diagonal is nonzero, relax point i; otherwise, skip it.
@ -3760,7 +3760,7 @@ HYPRE_Int hypre_ParCSRRelaxThreads(hypre_ParCSRMatrix *A,
ns = j*size+rest; ns = j*size+rest;
ne = (j+1)*size+rest; ne = (j+1)*size+rest;
} }
for (i = ns; i < ne; i++) /* interior points first */ for (i = ns; i < ne; i++) /* interior points first */
{ {
/*----------------------------------------------------------- /*-----------------------------------------------------------
* If diagonal is nonzero, relax point i; otherwise, skip it. * If diagonal is nonzero, relax point i; otherwise, skip it.
@ -3791,7 +3791,7 @@ HYPRE_Int hypre_ParCSRRelaxThreads(hypre_ParCSRMatrix *A,
u_data[i] += (c1*res + c2*res2) / l1_norms[i]; u_data[i] += (c1*res + c2*res2) / l1_norms[i];
} }
} }
for (i = ne-1; i > ns-1; i--) /* interior points first */ for (i = ne-1; i > ns-1; i--) /* interior points first */
{ {
/*----------------------------------------------------------- /*-----------------------------------------------------------
* If diagonal is nonzero, relax point i; otherwise, skip it. * If diagonal is nonzero, relax point i; otherwise, skip it.