Or you could use Brent's algorithm No!! That's not a root finding algorithm, it's function minimization. See https://www.boost.org/doc/libs/1_71_0/libs/math/doc/html/math_toolkit/roots_... \math\example\brent_minimise_example.cpp, but you still need to provide bracket values, and choosing -infinity and +infinity will not be fast. (Again limiting the number of iterations is wise if you fear a long wait).
Fundamentally it is important to provide the algorithm with as much info as possible as a guess, bracket limits, and is rising or falling in order that it works efficiently, or indeed at all.
I suspect you do know more really?
HTH
Paul
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org https://lists.boost.org/mailman/listinfo.cgi/boost-users