Numerical Analysis
Bisection Method
The bisection method is used to find the roots of a polynomial equation. It separates the interval and subdivides the interval in which the root of the equation lies. The principle behind this method is the intermediate theorem for continuous functions.
Regula-Falsi Method
Regula-Falsi method is described as the trial and error approach of using “false” or “test” values for the variable and then altering the test value according to the result. In this article, you will learn how to solve an equation in one variable using the false position method. Also, get solved examples on the regula falsi method here.
Newton-Raphson Method
The Newton-Raphson method begins with an initial estimate of the root, denoted x0≠xr, and uses the tangent of f(x) at x0 to improve on the estimate of the root
Secant Method
Secant method is also a recursive method for finding the root for the polynomials by successive approximation. It’s similar to the Regula-Falsi method but here we don’t need to check f(x1)f(x2)<0 again and again after every approximation
Fixed Point Iteration Method
The fixed point iteration method in numerical analysis is used to find an approximate solution to algebraic and transcendental equations. Sometimes, it becomes very tedious to find solutions to cubic, bi-quadratic and transcendental equations; then, we can apply specific numerical methods to find the solution; one among those methods is the fixed point iteration method.