> One interesting thing is that I made it so that > > f.find_root(a,b) > > works even if the sign of f(a) and f(b) are the same. In that case, > it will find a min or max of f on the interval, and use that as a new > endpoint as input to the root finding algorithm. The root finder > itself is some serious numerical code from scipy...
I wonder how this can work. Assume f has no root on [a,b], for example f = 1/2 + sin(x) on [0,3]. What does f.find_root(0,3) return? Another interesting example to try is f = 1-2*exp(-6*((x-1)^2)^(1/6)) on [0,2] (or replace 6 by any larger even integer). Paul --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/ -~----------~----~----~----~------~----~------~--~---
