Gauss Elimination (Solution System of Linear Equation)

Gaussian Elimination

We list the basic steps of Gaussian Elimination, a method to solve a system of linear equations. Except

for certain special cases, Gaussian Elimination is still \state of the art."" After outlining the method, we

will give some examples. Gaussian elimination is summarized by the following three steps:

Secant Method (Open Method)

Secant Method

The secant method requires two initial points x0 and x1 which are both reasonably close to the

solution x_. Preferably the signs of y0 = f(x0) and y1 = f(x1) should be different. Once x0 and x1

are determined the method proceeds by the following formula:

xi+1 = xi −

xi − xi−1

yi − yi−1

Netwon Raphson

Newton Raphson Method

In numerical analysis, Newton's method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real-valuedfunction. The algorithm is first in the class of Householder's methods, succeeded by Halley's method. The method can also be extended to complex functions and to systems of equations.

Ragula Falsi Method

Regula-Falsi Method

The Regula-Falsi Method (sometimes called the False Position Method) is a method used to find a numerical estimate of an equation. This method attempts to solve an equation of the form f(x) = 0. (This is very common in most numerical analysis applications.) Any equation can be written in this form. This algorithm requires a function f(x) and two points a and b for which f(x) is positive for one of the values and negative for the other. We can write this condition as f(a)×f(b)<0. Starting criteria is same as bisection method does, it takes two values to get it started.

Bisection Method

Bisection Method

The bisection method in mathematics is a root-finding method which repeatedly bisects an interval and then selects a subinterval in which a root must lie for further processing. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods. The method is also called the binary search method and is similar to the Binary Search algorithm in computing, where the range of possible solutions is halved each iteration.