APPLIED NUMERICAL ANALYSIS S.

Raja Ramanathan

NEWTON RAPHSON METHOD:

ORDER OF CONVERGENCE: 2

ADVANTAGES:
1. The advantage of the method is its order of convergence is quadratic.
2. Convergence rate is one of the fastest when it does converges
3. Linear convergence near multiple roots.

DISADVANTAGES:
1. It needs the function evaluation and then the derivative evaluation.
2. If the tangent is parallel or nearly parallel to the x-axis, then the method does not
converge.
3. Usually Newton method is expected to converge only near the solution.

REGULA FALSI METHOD:

ORDER OF CONVERGENCE: 1.618

ADVANTAGES:
1. Better-than-linear convergence near simple root
2. Linear convergence near multiple root
3. No derivative needed

DISADVANTAGES
1. Iterates may diverge
2. No practical & rigorous error bound

GRAEFFE’S METHOD:

ADVANTAGES:
1. It is used to find real, distinct, complex and double roots.
2. It is the direct method of finding solution.

DISADVANTAGES:
1. It has numerically complicated procedure.

LIN-BAIRSTOW METHOD

ADVANTAGES:
1. It is used to find all roots of the equation.

Page 1 of 3
APPLIED NUMERICAL ANALYSIS S.Raja Ramanathan

DISADVANTAGES:
1. Long division of the polynomial to be solved

GAUSS ELIMINATION METHOD:

ADVANTAGES:
1. It is the direct method of solving linear simultaneous equations.
2. It uses back substitution.
3. It is reduced to equivalent upper triangular matrix.

DISADVANTAGES:
1. It requires right vectors to be known.

GAUSS JORDAN:

ADVANTAGES:
1. It is direct method.
2. The roots of the equation are found immediately without using back substitution.
3. It is reduced to equivalent identity matrix.

DISADVANTAGES:
1. The additional steps increase round off errors.
2. It requires right vectors to be known.

LU DECOMPOSITION:

ADVANTAGES:
1. Suppose we want to solve a m×n system AX = b.
If we can find a LU-decomposition for A , then to solve AX =b, it is enough to solve the
systems

Thus the system LY = b can be solved by the method of forward substitution and the
system UX = Y
can be solved by the method of backward substitution.
2. The advantage is that the solution of triangular set of equations is trivial to solve.
3. It is direct method.
4. Applicable for any matrix
5. Finds all solutions
6. Easy to program
7. Fast

Page 2 of 3
APPLIED NUMERICAL ANALYSIS S.Raja Ramanathan

DISADVANTAGES;
1. Does not Find approximate solutions (least square)
2. Could easily be unstable

CROUT’S METHOD:

ADVANTAGES:
1. The advantage is that the solution of triangular set of equations is trivial to solve.
2. It is direct method.
3. Applicable for any matrix
4. Finds all solutions
5. Easy to program
6. Fast

DISADVANTAGES:
1. Complete pivoting is almost impossible and only the partial column wise pivoting is
possible

GAUSS JACOBI METHOD:

1. It is iterative method.
2. The system of equations must be diagonally dominant.
3. It suits better for large numbers of unknowns
4. It is self correcting method.

GAUSS SEIDEL METHOD:

1. It is iterative method.
2. The system of equations must be diagonally dominant.
3. It suits better for large numbers of unknowns
4. It is self correcting method.
5. The number of iterations is less than Jacobi method.

Page 3 of 3