0% found this document useful (0 votes)
3 views

Lecture 3

Chapter 3 focuses on methods for finding roots of equations, including the Bisection Method, Fixed Point Iteration, and Newton’s Method. It emphasizes the Fixed Point Method, detailing its objectives, the Fixed Point Theorem, and its application using MATLAB. The chapter includes practical examples and iterations to illustrate the method's convergence.

Uploaded by

Ahmed Mohamed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Lecture 3

Chapter 3 focuses on methods for finding roots of equations, including the Bisection Method, Fixed Point Iteration, and Newton’s Method. It emphasizes the Fixed Point Method, detailing its objectives, the Fixed Point Theorem, and its application using MATLAB. The chapter includes practical examples and iterations to illustrate the method's convergence.

Uploaded by

Ahmed Mohamed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Chapter 3

Roots of Equations
Contents of the chapter

3.1 The Bisection Method


3.3 Fixed Point Iteration
3.5 Newton’s Method

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 3


3.3
Fixed Point Method

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 4


3.3 Fixed Point Method

Objectives:

 Use the fixed point iteration to approximation the root of an


equation
 Prove the fixed point therom
 Find the interval of a function on which fixed point iteration will
converge
 Apply matlab to solve a problem by using fixed point method

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 5


“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 6
“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 7
Solution

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 8


Theorem 3.2 ( Fixed Point Theorem )

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 9


Proof

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 10


“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 11
Solution

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 12


Solution

+
+
+

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 13


“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 14
Now it’s your turn

>> FixedP
enter the value of initial approximation P0: 4
enter the number of iteration: 20
1.000000000000000 1.500000000000000

2 -6

3.000000000000000 -0.375000000000000

4.000000000000000 -1.263157894736842

5.000000000000000 -0.919354838709677

6.000000000000000 -1.027624309392265

7.000000000000000 -0.990875912408759

8.000000000000000 -1.003050640634533
“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 15
9.000000000000000 -0.998984152783421

10.000000000000000 -1.000338730438317

11.000000000000000 -0.999887102601156

12.000000000000000 -1.000037633882537

13.000000000000000 -0.999987455529853

14.000000000000000 -1.000004181507534

15.000000000000000 -0.999998606166098

16.000000000000000 -1.000000464611516

“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 16


“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 17
“An introduction to numerical methods, A matlab approach“ , Third edition Slide 1 - 18

You might also like