Using ROOT's root-finding algorithms

Dear ROOTers,

I have some questions about how to best use ROOT's root-finding algorithms. I need to find the root of a 1D analytical function in a bound range [0, M]. The derivative of the function is available. As far as I can tell, in ROOT the algorithms that use the derivative do not accept a range. Does anyone know the rational for that?

I need very fast performance, hence the use of the derivative. But perhaps Brent's method is so good that there's nothing to gain from a derivative?

As a work-around, I can map (0, M) unto the entire real axis, and check the edges separately. This seems a generic trick, so I wonder if there's a reason, besides the obvious "no one got around to it", why this isn't available in ROOT?

 thanks,
 Amnon Harel Received on Sun Mar 25 2012 - 22:01:26 CEST