Talk:Roots of a function

I think that traditionally root finding algorithms have a very small difference value defined (called "epsilon" when I learned it) where if abs(f(x)) < this difference, then x is considered "close enough to a root." This is usually related to some sort of named root finding algorithm like bisection, regula falsi, or Newton's method (he has too many methods). Maybe this task could be edited (or other tasks made) to include those methods (I can give C code or at least pseudocode for some). --Mwn3d 18:59, 21 February 2008 (MST)