An efficient implementation of the zeta-function algorithm for accurate computing Bernoulli numbers
-
Updated
Dec 5, 2018 - Python
An efficient implementation of the zeta-function algorithm for accurate computing Bernoulli numbers
Add a description, image, and links to the euler-maclaurin topic page so that developers can more easily learn about it.
To associate your repository with the euler-maclaurin topic, visit your repo's landing page and select "manage topics."