** suivant:** fsolve or nSolve with
** monter:** Solve equations with fsolve
** précédent:** fsolve or nSolve with
** Table des matières**
** Index**

The Brent method interpolates of *f* at three points, finds
the intersection of the interpolation with the *x* axis, computes
the sign of *f* at this point and chooses the interval where the sign changes.
It is generically faster than bisection.

Input :
`fsolve((cos(x))=x,x,-1..1,brent_solver)`

Output :
`[0.73908513321 5,0.739085133215]`

giac documentation written by Renée De Graeve and Bernard Parisse