How can I test whether a given 1D root-finding procedure is robust? I know that there are data sets and resources online for different kinds of optimization, but I have yet to find anything with regard to 1D root-finding. Do you happen to know of any data sets or functions that are commonly used to test the robustness of 1D root-finding procedures?
In particular, I would like to see some functions that will break software that has not been written carefully to account for finite-precision arithmetic.
Thanks for your input!