Commit de16385b authored by Stefan's avatar Stefan
Browse files

Add smoother iteration check in setup tool

parent 2a2ee520
......@@ -42,6 +42,8 @@
## Known Bugs
[628](https://github.com/Nek5000/Nek5000/issues/628)
[627](https://github.com/Nek5000/Nek5000/issues/627)
[562](https://github.com/Nek5000/Nek5000/issues/562),
[65](https://github.com/Nek5000/Nek5000/issues/65)
......
c-----------------------------------------------------------------------
VERSION WITH SIMPLE BISECTION AND GROWTH OF CONN SET, COMBO (klh 07/09)
c
c VERSION WITH SIMPLE BISECTION AND GROWTH OF CONN SET, COMBO (klh 07/09)
c
c genmap.f performs the following operations:
c
......
......@@ -82,7 +82,7 @@ int main(int argc, char *argv[])
}
if (tol <= 0.)
{
printf("Error: Smoother tolerance should be >0.\n");
printf("ERRORr: Smoother tolerance should be >0.\n");
exit(1);
}
......@@ -199,6 +199,11 @@ int main(int argc, char *argv[])
HYPRE_BoomerAMGCreate(&solver); // Create solver
/* Set parameters (See Reference Manual for more parameters) */
HYPRE_BoomerAMGSetStrongThreshold(solver,0.5);
if(coars_strat == 8 || coars_strat == 10)
HYPRE_BoomerAMGSetStrongThreshold(solver,0.5);
HYPRE_BoomerAMGSetPrintLevel(solver, print_level);
HYPRE_BoomerAMGSetCoarsenType(solver, coars_strat);
HYPRE_BoomerAMGSetInterpType(solver, interp_strat);
......@@ -220,7 +225,7 @@ int main(int argc, char *argv[])
/* Check if last level is made of 1 element */
if (A_array[numlvls-1]->diag->num_rows != 1)
{
printf("Error: Last level has more than one element. Run again with different setup options.\n");
printf("ERROR: Invalid size of last level, try different coarsening!");
exit(1);
}
......@@ -400,6 +405,10 @@ int main(int argc, char *argv[])
data->m[lvl] = m;
printf("Chebyshev smoother iterations: %d\tContraction: %lf\n",
(int)m,c);
if((int)m > 3){
printf("ERROR: Smoother iterations too large, try different coarsening!");
exit(1);
}
free(Dh);
free(lambda);
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment