# Runge-Kutta Methods – Algorithm, Implementation in C With Solved Examples

Runge-Kutta Method
Finding the solution of differential equation the Runge Kutta method give more accurate result. The Euler method is less efficient in practical problems

# Euler Method – Algorithm, Implementation in C With Solved Examples

Euler Method for Differential Equation
Euler method is the most simple but crude method to solve differential equation of the form
Where A,

# Gauss Seidel Method – Algorithm, Implementation in C With Solved Examples

Gauss Seidel Iteration Method
A simple modification of Jocobi’s iteration sometimes gives faster convergence, the modified method is known as Gauss Seidel method.
Let us

# Gauss-Jacobi’s Iteration Method – Algorithm, Implementation in C With Solved Examples

To find the solution of system of linear equations, in this article we will discuss Gauss-Jacobi’s iteration method.
Solution of System of Linear Equations
Generally,

# Newton-Raphson Method – Algorithm, Implementation in C With Solved Examples

To solve non-linear function of the real variable x we have already learned Bisection method and Iteration method, in this article we are going to

# Iteration Method or Fixed Point Iteration – Algorithm, Implementation in C With Solved Examples

Iteration Method or Fixed Point Iteration
The iteration method or the method of successive approximation is one of the most important methods in numerical mathematics.

# Bisection Method – Algorithm, Implementation in C with Solved Examples

Bisection Method
The Bisection method is the most simplest iterative method and also known as half-interval or Bolzano method.
This method is based on the