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.

Sign up for GitHub

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

Jump to bottom

Examine Boost and GSL #75

Open

nieksand opened this issue Jan 26, 2018 · 3 comments

Owner

nieksand commented Jan 26, 2018

Look for design ideas. Cross-validate general designs.

Owner Author

nieksand commented Jan 26, 2018 •

edited

Loading

For Boost bisection:
https://github.com/boostorg/math/blob/242e9d669198415d165bb0213f730c00985bee9a/include/boost/math/tools/roots.hpp#L137

explicit exact 0 checks on initial boundary (return degenerate final interval)
check if mid equals boundaries. stop iterating
explicit exact 0 checks on each mid (return degenerate if found)

GSL bisection:

also bails early on exact 0 hit for initial boundary and on mid

Owner Author

nieksand commented Jan 29, 2018

Also worth squinting at dzero which is mentioned:

Krogh, F. T. (2006). On developing mathematical software. Journal of computational and applied mathematics, 185(2), 196-202.

Owner Author

nieksand commented Feb 13, 2018

SciPy also has some pretty extensive coverage:
https://docs.scipy.org/doc/scipy/reference/optimize.html

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment