School of Chemical Engineering and

Physical Sciences
Term paper
MTH 314
Topic: Solution of Non-linear Simultaneous
Equations using Newton-Raphson Method
Submitted to: Dr. Geeta Arora
Submitted by: Koyyana Koshika
Regi no:12221620
Roll no:7
Introduction
Non-linear simultaneous equations are a set of equations where one or more
of the equations involve non-linear functions of the variables. These equations
do not have a simple algebraic solution, unlike linear simultaneous equations.
Solving such systems often requires the use of numerical methods or
approximation techniques. One common method for solving non-linear
simultaneous equations is the iterative method, such as the Newton-Raphson
method or the Broyden's method.

Let's take an example of a system of non-linear simultaneous equations:

 x 2+ y 2=25
 x + y=5

Newton Raphson Method or Newton Method is a powerful technique for

solving equations numerically. It is most commonly used for approximation of
the roots of the real-valued functions. Newton Rapson Method was developed
by Isaac Newton and Joseph Raphson, hence the name Newton Rapson
Method.

Newton Raphson Method involves iteratively refining an initial guess to

converge it toward the desired root. However, the method is not efficient to
calculate the roots of the polynomials or equations with higher degrees but in
the case of small-degree equations, this method yields very quick results. It is
particularly useful for finding the roots of differentiable functions. The method
starts with an initial guess, then refines this guess using the function's
derivative to find successively better approximations.

The basic principle of the Newton-Raphson method can be described as

follows:

1. Start taking a initial guess, x 0

2. Find the function's derivative, f′(x).
f (x )
n
3. Use the formula: x n+1=x n − f ' (x )
n

where
 x n+1 is the next approximation of the root.
  x n is the current approximation of the root.
 f( x n ¿ is the function value at x n
 f’( x n ¿ is the derivative of the function at x n

Repeat this process until the desired level of accuracy is achieved or until the
algorithm converges to a satisfactory solution.

Solution of Non-linear Simultaneous Equations using

Newton-Raphson Method
It is possible to use Newton-Raphson method to solve a system of nonlinear
equations:
f 1 ( x 1 , … , x n ) =0
:
:
:
f n ( x 1 , … , x n ) =0

Note that the number of unknowns equals the number of equations. We can
write this using vector notation as

f(x)=0,

where x=(x 1 , … , x n)' and f ( x )=(f 1 ( x ) , … , f n ( x ))'

The Newton-Raphson iteration for this system is

−1
x n+1=x n − j ( x n ) . f ( x n)

Where j is a jacobian matrix

Scilab code for solution of non linear Simultaneous
Equations using Newton-Raphson Method
function y=f(x)
y=[x(1)^2+x(1)*x(2)-10,x(2)+3*x(1)*x(2)^2-57]'
endfunction
function y=jacob(x)
y=[2*x(1)+x(2) x(1);3*x(2)^2 1+6*x(1)*x(2)]
endfunction
x=input("enter x0 as a column vector:")
n=input("enter number of iteration:")
X=[]
for k=1:n
x=x-jacob(x)\f(x)
X=[X,x]
end
disp(X)
solution
enter x0 as a column vector:[0,0.6]'

enter number of iteration:12

column 1 to 5

16.666667 5.4449273 1.4518218 0.6975429 0.8279915

39. 32.635682 28.311641 21.653653 9.3281126

column 6 to 12

1.5348932 1.9019552 1.9728125 1.9998223 2. 2. 2.

1.8717032 3.7984858 3.0725649 3.0000069 3. 3. 3.

Drawbacks for newton Raphson method

1. Divergence at inflection points

If the selection of the initial guess or an iterated value of the root turns out to
be close to the inflection point of the function f(x) in the equation f(x)=0,
Newton-Raphson method may start diverging away from the root. It may then
start converging back to the root

2. Division by zero
3. Oscillations near local maximum and minimum

Results obtained from the Newton-Raphson method may oscillate about the
local maximum or minimum without converging on a root but converging on
the local maximum or minimum. Eventually, it may lead to division by a
number close to zero and may diverge. For example, for f ( x )=x 2 +2=0equation
has no real roots .

4. Root jumping

In some case where the function f(x) is oscillating and has a number of roots,
one may choose an initial guess close to a root. However, the guesses may
jump and converge to some other root.
Conclusion

Generally Newton-Raphson has speedy quadratic convergence as in the case of

single nonlinear equation . When we use the Newton-Raphson Method or the
Arithmetic Mean Newton’s Method to solve a system of nonlinear equations
with multiple variables, the initial value is very important. If you have chosen a
"nice" initial guess, then the nonlinear system is likely to converge to the
solution of your nonlinear system, otherwise, it may fail to converge, and this
will have the chance to result in an oscillation between points.