-
Notifications
You must be signed in to change notification settings - Fork 106
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
use deterministic RNG initial state #304
base: master
Are you sure you want to change the base?
Conversation
Weird, I can't replicate the test failure locally… |
Okay, now I can replicate a failure. It looks like one issue was that |
The commit a4db20b had some build's passing, are the errors just from having different seeds and too tights bounds for stochastic tests? |
Looks like it. I switched to Note that one of the failures is not just a tolerance thing, but a robustness problem: the Cholesky factorization here is sometimes failing because the matrix is indefinite (a nearly zero eigenvalue that is slightly indefinite … basically it looks like The other failure is on
where it looks like the tolerance might be too small. (Not sure why you are using |
Ping @haampie |
@stevengj What to do with the tests? I agree that we can soften a bound for the second failure. |
8f17a0e
to
5f67971
Compare
There is one test passing,
|
Closes #303.
Uses a deterministic RNG of
MersenneTwister(seed)
for generating initial vectors in iterative algorithms that use random initial vectors, controllable via anrng
keyword.(In some cases, the
rng
keyword is redundant, because the algorithm alternatively allows you to pass the initial vector directly, but it seemed better to me to have a consistent API that can be used with any of the iterative solvers doing pseudorandom initialization.)(Bumped Julia requirement to 1.4 to support broadcasting RNG objects.)