next up previous contents
Next: Newton method for solving Up: Brent method for solving Previous: Mathematical background   Contents

Implementation

Brent's method enable to find a root of an equation $F(x)=0$ as soon as the root is bracketed in an interval $[x_1,x_2]$ such that $F(x_1)F(x_2)<0$. It is implemented as:
 
int Brent(REAL (* TheFunction)(REAL),INTERVAL &Input,
      double AccuracyV,double Accuracy,int Max_Iter,double *Sol, double *Residu)
with: The procedure returns: The test program Test_Ridder2 present a program to solve the trigonometric equation presented as example 2 (see section 15.1.1).


next up previous contents
Next: Newton method for solving Up: Brent method for solving Previous: Mathematical background   Contents
Jean-Pierre Merlet 2012-12-20