Roots Of Equations
- Bisection Method: Start with a function f(x) and two values of x (a and b) such that f(a) and f(b) have opposite signs. These values of a and b may be the final interval of an incremental search method with a relitavely large step size.
- Evaluate f(x) at the midpoint of the interval, at xmid = a+b / 2
- False Position Method:
- It's a root-finding algorithm that combins features of the bisection method and the secant method.
- Fixed Point Method: The method starts with this concept f(x) = 0 ---> x = g(x) It predicts the value of the function based on the value of the same function. Xi+1 = g(xi).
- Newton-Raphson Method: This method is the most used for the determination of roots. A good approach is where the derivative cuts zero, and it should exist a near point.
In the Newton-Raphson method
The Newton-Raphson method is based on the principle that if the initial guess of the root of f(x)=0 is at xi, then if one draws the tangent to the curve at f(xi), the point xi+1 where the tangent crosses the x-axis is an improved estimate of the root.
- Secant Method: This is a derivation of the Newton - Raphson method. This method needs two points of departure and has and advantage: it doesn't need the derivative of f(x).