index 5dfb4363d62b42740e83ebf92df8f076c26a6749..67d15d6a041802d72eb9ae9417a4df9948055b08 100644 (file)
}
}
+/*
static double Linfty(valarray<double> const &vec) {
return std::max(vec.max(), -vec.min());
}
+*/
double
inner(valarray<double> const &x,
r -= alpha_k*Ap;
r_r = r_r_new;
}
- printf("njh: %d iters, Linfty = %g L2 = %g\n", k,
- std::max(-r.min(), r.max()), sqrt(r_r));
+ //printf("njh: %d iters, Linfty = %g L2 = %g\n", k,
+ //std::max(-r.min(), r.max()), sqrt(r_r));
// x is solution
}
/*