I tried to implement a different implementation of the ziggurat method for
generating standard normal distributions that is about twice as fast and uses
2/3 of the memory than the old one.
I tested the implementation separately and am very confident it's correct, but
it does fail 28 test in coverage testing.
Checking the testing code I found out that all the failed tests are inside
TestRandomDist which has the goal of "Make[ing] sure the random distribution
returns the correct value for a given seed". Why would this be needed?
The only explanation I can come up with is that it's standard_normal is, in
regards to seeding, required to be backwards compatible. If that's the case how
would, could one even implement a new algorithm?
_______________________________________________
NumPy-Discussion mailing list
NumPy-Discussion@python.org
https://mail.python.org/mailman/listinfo/numpy-discussion
