A comparative study of non-linear

equation on numerical analysis

Submitted By
Hina Zahid BC210420488

Submitted To
JAMSHED NASIR
DEPARTMENT OF MATHEMATICS
FACULTY OF SCIENCE AND TECHNOLOGY
VIRTUAL UNIVERSITY OF PAKISTAN
Spring 2023
 OUTLINES

 Introduction
 Methods to Solve Non-Linear Equations
 Secant Method
 Regula Falsi Method
 Fixed Point Iterative Method
 Bisection Method
 Newton Raphson Method
 References

2
 Introduction
 In numerical analysis, a nonlinear equation is an equation that cannot be solved using
simple algebraic techniques. Nonlinear equations are often used to model complex
relationships between quantities, such as the growth of populations, the spread of
diseases, and the behavior of financial markets
 Non-linear equations are ubiquitous in science, engineering, economics, and many
other fields. They often describe complex phenomena that cannot be simplified into
linear relationships.
 Numerical analysis is a branch of mathematics that deals with the development of
algorithms and methods to approximate solutions to mathematical problems, including
non-linear equations.
 Non-linear equations come in various forms, such as algebraic, transcendental, and
differential equations. 3
Continue…

 The aim of this study is to compare different numerical methods for solving non-linear
equations. These methods include but are not limited to, the Newton-Raphson method,
the bisection method, and the secant method
 We will evaluate these numerical methods based on their efficiency in terms of
convergence speed.
 Each numerical method has unique algorithmic characteristics. Some methods might
converge faster for certain types of equations, while others may be more robust in a
wider range of scenarios.
 Understanding the performance of these methods is crucial for real-world applications.
For instance, engineers often encounter non-linear equations when optimizing designs,
and economists rely on them for modeling
4
complex systems.
Continue…

 This research provides a foundation for further exploration into advanced techniques
and adaptations of numerical methods to tackle increasingly complex non-linear
equations in various domains.
 A comparative study of non-linear equations in numerical analysis serves as a valuable
resource for researchers, practitioners, and students seeking to efficiently solve and
understand the behavior of non-linear equations in their respective fields.

5
 Method to Solve Non-linear Equation
 Polynomials with more than one degree can be coupled to form non-linear algebraic equations,
commonly known as polynomial equations. Root-finding algorithms, for example, can be used to
find solutions to a single polynomial problem (i.e., sets of values for the variables that satisfy the
equation).

 The study of harder systems of algebraic equations is one of the goals of algebraic geometry, a
challenging subject of modern mathematics. Even determining if an algebraic system includes
complex solutions can be challenging.

 However, there are many efficient techniques for solving polynomial equation systems with a finite
number of complex solutions.

6
 Secant Method

 The secant method is similar to the Newton-Raphson method, but it does not
require the derivative of the function. This makes the secant method more
versatile, as it can be used to solve problems where the derivative is not
available.
 The secant method is also more efficient than the Newton-Raphson method in
some cases. This is because the secant method does not require the calculation
of the derivative, which can be a computationally expensive operation
 However, the secant method can be less accurate than the Newton-Raphson
method in some cases. This is because the secant method is based on a linear
approximation of the function, while the Newton-Raphson method is based on a
quadratic approximation of the function. Overall, the secant method is a
powerful tool for finding roots of nonlinear equations.
7
 Secant Method

Given a nonlinear equation and two initial guesses and , the secant method
iteratively updates the guesses to obtain better approximations of the root. The
iterative formula for the method is given by:

8
Continue
 Find a root of an equation f ( x)  2 x  2 x  5
3
using secant method.
 Solution
2 x3  2 x  5  0
 First iteration f ( x)  2 x 3  2 x  5

x0  1 and x1  2
f  x0   f 1  5 and f  x1   f  2   7
x1  x0
 x2  x0  f  x0  .
f  x1   f  x0 
2 1
x2  1  (5) 
7  (5)
x2  1.41667
 f  x2   f (1.41667)  2(1.41667)3  2(1.41667)  5  2.14699

9
Continue
2nd Iteration:
x1  2 and x2  1.41667
f  x1   f  2   7 and f  x2   f 1.41667   2.14699
x2  x1
 x3  x1  f  x1  .
f  x2   f  x1 
1.41667  2
x3  2  7 
2.14699  7
x3  1.55359
 f  x3   f (1.55359)  2(1.55359)3  2(1.55359)  5  0.60759

3rd Iteration: x2  1.41667 and x3  1.55359

f  x2   f 1.41667   2.14699 and f  x3   f 1.55359   0.60759
x3  x2
 x4  x2  f  x2  .
f  x3   f  x2 
1.55359  1.41667
x4  1.41667  (2.14699) 
0.60759  (2.14699)
x4  1.60763 10

 f  x   f (1.60763)  2(1.60763)3  2(1.60763)  5  0.09449

Continue

 4th Iteration:
x3  1.55359 and x4  1.60763
f  x3   f 1.55359   0.60759 and f  x4   f 1.60763   0.09449
x4  x3
 x5  x3  f  x3  .
f  x4   f  x3 
1.60763  1.25311
x5  1.25311   0.60759  
0.09449  (0.60759)
x5  1.60036
 f  x5   f (1.60036)  2(1.60036)3  2(1.60036)  5  0.00324

11
 Regula Falsi Method

The Regula Falsi method, also known as the False Position method, is a numerical
iterative method used for finding the roots of a nonlinear equation. It is an
improvement over the bisection method, aiming to provide faster convergence by
utilizing linear interpolation.

Given a nonlinear equation and an interval containing a root, the Regula Falsi method
iteratively narrows down the interval by determining a new point c within the interval.
The new point c is determined by finding the intersection of the x-axis with the line
passing through the points and The new 12interval is then chosen based on the sign of
Continue…
 Convergence Test: Check if the current estimate is sufficiently close to the true
solution. If it meets the desired accuracy or if it converges to a fixed point, you can stop
the iteration.

 Update Estimate: If the convergence criteria are not met, update the estimate by
applying the iterative procedure again, using the current estimate as the input.

 Repeat: Continue the iteration process until the desired level of accuracy is achieved or
until convergence is achieved.

13
 Example

3
 Find using
48
regula falsi method.
1
 solution x  48 3
 x 3  48
 x 3  48  0
i.e. f ( x)  x 3  48

1st Iteration:
f (3)  21  0 and f (4)  16  0
 Now, root lies between x 0  3 and x 1  4
x1  x0
x 2  x 0  f ( x0 ).
f ( x1 )  f ( x0 )
43
x 2  3   21.
16  (21)
x 2  3.5676
f ( x2 )  f 3.5676   (3.5676) 314 48  2.5936  0
 continue
2nd Iteration:
f 3.5676   2.5936  0 and f (4)  16  0
 Now, root lies between x 0  3.5676 and x1  4
x1  x0
x 3  x 0  f ( x0 ).
f ( x1 )  f ( x0 )
4  3.5676
x 3  3.5676   2.5936  .
7  (2.5936)
x 3  3.6279
f ( x3 )  f 3.6279   (3.6279)3  48  0.2513  0

15
 continue
3rd Iteration:
f 3.6279   0.2513  0 and f (4)  16  0
 Now, root lies between x 0  3.6279 and x 1  4
x1  x0
x 4  x 0  f ( x0 ).
f ( x1 )  f ( x0 )
4  3.6279
x 4  3.6279   0.2513.
16  (0.2513)
x 4  3.6336
f ( x4 )  f 3.6336   (3.6336)3  48  0.0237  0

16
 continue
4th Iteration:
f 3.6336   0.0237  0 and f (4)  16  0
 Now, root lies between x 0  3.6336 and x1  4
x1  x0
x 5  x 0  f ( x0 ).
f ( x1 )  f ( x0 )
4  3.6336
x 5  3.6336   0.0237  .
16  (0.0237)
x 5  3.6342
f ( x5 )  f 3.6342   (3.6342)3  48  0.0022  0

17
 fixed point Iteration Method Numerical
Example
Find a root of an equation using fixed point iteration method.
Solution
Let
f ( x)  x3  x  1
Here
x3  x  1  0
 x3  x  1
x  3
x 1
  x   3
x 1
18
Continue…

x 0 1 2
Here, F(x) -1 -1 5

Here,
f (1)  1  0 and f(2)=5>0
Root lies between 1 and 2.
1 2
x0   1.5
2
x1    x0    1.5   1.35721
x 2    x1    1.35721  1.33086
x 3    x2    1.33086   1.32588
x 4    x3    1.32588   1.32494
x 5    x4    1.32494   1.32476
19
Continue…

Approximate root of the equationx^3-x-1 using iteration method is 1.32476(After 5

N x1 x1    x0  update Difference
iterations) x1-x0
1 1.5 1.35721 = 0.14279
2 1.35721 1.33086 = 0.02635
3 1.33086 .32588 = 0.00498
4 1.32588 1.32494 = 0.00094
5 1.32494 1.32476 = 0.00018

20
 Bisection Method

 The bisection method is a simple iterative numerical algorithm used to find the root of a
continuous function within a given interval.

 It is based on the intermediate value theorem, which states that if a continuous function
changes sign over an interval, it must have at least one root within that interval.

 In mathematics, the bisection method is a root-finding method that applies to any

continuous function for which one knows two values with opposite signs.

 This method consists of repeatedly bisecting the interval defined by these values and
then selecting the sub interval in which the function changes sign, and therefore must
contain a root.
21
Continue…

 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.

 This method is also called the interval halving method, the binary search method, or the
dichotomy method.

22
 Bisection Method Numerical
Example
Find the root of the following polynomial function using the bisectional method:

x 3
 3x  5
x3  3x  5
Solution .

Now,
23
Continue…

Then,

Thus the roots lies in

x3  3x  5

24
 Newton Raphson Method
The Newton-Raphson method, also known as Newton's method, is an iterative numerical
method used to find successively better approximations of the roots of a real-valued
function. It is based on the idea of using the tangent line to approximate the behavior of
the function near a root.

Given a function and an initial guess , the Newton-Raphson method iteratively updates
the guess to obtain a more accurate approximation of the root. The iterative formula for
the method is given by:

25
Continue…
where

 is the current guess for the root.

 is the updated guess for the root.

 is the value of the function at .

 is the derivative of the function evaluated at .

The process is repeated until a desired level of accuracy is achieved.

26
 Newton Raphson Method Numerical
Example
Find the first three iteration of equation f ( x)  x  0.8  0.2sin x in the interval
 
0, 2 
Solution
f  0   0  0.8  0.2sin(0)  0.8
f (1.57)  1.57  0.8  0.2sin(1.75)
=1.57-0.8-0.2sin(0.99999)
=1.57-0.8-0.199998
=0.570002
f ( x)  1  0.2cos x
f (0)  1  0.2cos(0)  1  0.2  0.8
27
Continue…

Here, f (0) is greater than

f ( x0 ) 0.8
x1  x0   0 1
f ( x0 ) 0.8
Now

f (1)  1  0.8  0.2 sin(1)

=1-0.8-0.1683
=0.0317
f ( x)  1  0.2 cos x
f (1)=1-0.2cos(1)
f (1)=1  0.1081
f (1)=0.8919
28
Continue…

f ( x1 ) 0.0317
x2  x1   1  1  0.0355  0.9645
f ( x1 ) 0.8919
f (0.9645)  0.9645  0.8  0.2sin(0.9645)
=0.9645  0.8  0.1645
=0.0002
f ( x)  1  0.2cos x
f (0.9645)  1  0.2cos(09645)  1  0.11396  0.88604
f ( x2 ) 0.0002
x3  x2   0.9645   0.9645  0.00022  0.9643
f ( x2 ) 0.88604

29
 References
[1]. Gilat, A., & Subramaniam , V. (2007). Numerical Methods For Engineers And
Sclentists (3rd ed.). WILEY.

[2]. Burden, R. L., & Faires, J. D. (2001). Numerical Analysis (9th ed.). Richard
Stratton.

[3]. Chapra , S. C. (2012). Applied Numerical Methods (4th ed.). McGraw-Hil.

30
31