Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
8 views27 pages

Numerical 4

The document discusses numerical methods for solving nonlinear equations, outlining steps for locating roots and introducing various iterative methods such as the Bisection method, False position method, Secant method, Simple iteration method, and Newton-Raphson method. It explains the Bisection method based on the intermediate value theorem and details the False position method, including its advantages and drawbacks. The document emphasizes the iterative approach to finding solutions and the importance of convergence in these methods.

Uploaded by

Radwa Essam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
8 views27 pages

Numerical 4

The document discusses numerical methods for solving nonlinear equations, outlining steps for locating roots and introducing various iterative methods such as the Bisection method, False position method, Secant method, Simple iteration method, and Newton-Raphson method. It explains the Bisection method based on the intermediate value theorem and details the False position method, including its advantages and drawbacks. The document emphasizes the iterative approach to finding solutions and the importance of convergence in these methods.

Uploaded by

Radwa Essam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 27

Numerical Methods

Dr. Radwa Essam


Numerical
solution of
nonlinear
equations
• Step 1: Location of roots
• Step 2: Using iterative methods of solution
• In this step, we introduce the following elementary

(1):
iterative methods for finding a solution of equation

1. Bisection method,
1.2 Methods 2. False position method,

of solutions 3. Secant method.


4. Simple iteration method,
5. Newton-Raphson method,
1.1 Location of roots
1.1.1 Analytical approach
1.2 Methods of solutions
1.2.1 Bisection method

Based on the intermediate value theorem


𝑓, defined on the interval [𝑎, 𝑏], is given with 𝑓(𝑎) and 𝑓(𝑏) of opposite signs. Following Theorem 1.1,
there exists a root α of the equation 𝑓(𝑥) = 0, 𝑎 < α < 𝑏, for which 𝑓(α) = 0.
1. Compute first approximation as the midpoint of [𝑎, 𝑏]
Error
1.2.2 False position method
1.2.2 False position method
• S𝒕𝒆𝒑 𝟏. Approximate the function 𝑓(𝑥) in the interval (𝑎, 𝑏) to a straight line joining the two points
(𝑎, 𝑓(𝑎)) and (𝑏, 𝑓(𝑏)) as shown in Fig. 3.8. The equation of this line i

• 𝑺𝒕𝒆𝒑 𝟐. The first approximate solution can be considered as the value which is the intersection of the
approximated straight line with the 𝑥 -axis. That is to say when 𝑦 = 0, . Substitute in the equation of the
straight line we ge
1.2.2 False position method
𝑺𝒕𝒆𝒑 𝟑. In the second approximation step, we consider a smaller range for the

three points (𝑎, 𝑓(𝑎)), (𝑏, 𝑓(𝑏)), (𝑥1, 𝑓(𝑥1)) at which the values of 𝑓(𝑥) have
chosen period, that is by considering a new straight line joining between two of the

opposite signs. For example: if 𝑓(𝑎) ≡ -𝑣𝑒 𝑓(𝑏) ≡ +𝑣𝑒 𝑓(𝑥1) ≡ -𝑣𝑒

𝑺𝒕𝒆𝒑 𝟑 is repeated until the difference between two successive approximations is


in the range of assumed allowable tolerance.
1.2.2 False position method
• Advantages and drawbacks of the false position method
The false position method is sometimes called the method of linear interpolation. It is a two-point method,

root faster. However, it may happen that most or all of the calculated 𝑥 values are in the same side of the root in
whereas Newton-Raphson is a one-point method. It has almost assured convergence, and it may converge to a

which case convergence may be slow.


1.2.3 The secant method
Thank you

You might also like