ES-341: Numerical Analysis: Dr. Mazhar Ali Mehboob Ul Haq (TA)

ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
ES-341: Numerical Analysis
Dr. Mazhar Ali

Mehboob ul Haq (TA)
Faculty of Engineering Sciences
Ghulam Ishaq Khan Institute of Engineering Sciences and Technology
30th March 2022
Dr. Mazhar Ali Mehboob ul Haq (TA) (GIKI) ES-341: Numerical Analysis 30th March 2022 1/7
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
1 Pseudo Codes
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
Bisection Method algorithmic procedure for solving f (x) = 0
(TA)
1 Let us consider a function f ∈ C [a, b].
Pseudo Codes
2 such that f (a) · f (b) < 0
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
3 Begin with initial interval a1 = a and b1 = b.
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
4 Let us start iteration counter with i = 1
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
Calculate xi = 12 (ai + bi )
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
If |f (xi )| < ϵ or |xi − xi−1 | < ϵ, then stop the iteration. If not then
continue ,
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
continue ,
If f (xi )f (ai ) > 0, then set ai+1 = xi and bi+1 = bi ;
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq
(TA)
Pseudo Codes
continue ,
If f (xi )f (ai ) > 0, then set ai+1 = xi and bi+1 = bi ; else
If f (xi )f (ai ) < 0, then set ai+1 = ai and bi+1 = xi ;
Set counter i = i + 1; Repeat;
5 Until unless
|xi − xi−1 | ≤ ϵ, OR, |f (xi )| ≤ ϵ
6 End procedure; xi+1 = p such that f (p) ≈ 0.
ES-341:
Numerical Fixed Point Algorithmic procedure for solving f (x) = 0
Analysis
Dr. Mazhar Ali We start with x0 and compute g (x0 ).

Mehboob ul Haq
(TA)
Pseudo Codes
ES-341:
Analysis
Dr. Mazhar Ali We start with x0 and compute g (x0 ). Later we choose the second guess
Mehboob ul Haq
(TA) as x1 = g (x0 )
Pseudo Codes
ES-341:
Analysis
Mehboob ul Haq
(TA) as x1 = g (x0 ) continue until we reach the fixed point p such that
Pseudo Codes
p = g (p).
Algorithmic steps
1 Formulate problem f (x) = 0 as fixed point problem x = g (x).
ES-341:
Analysis
Mehboob ul Haq
Pseudo Codes
p = g (p).
Algorithmic steps
2 Check convergence condition i.e., max |g ′ (x)| ≤ k < 1
x∈[a,b]
3 Choose an initial guess x0 .
ES-341:
Analysis
Mehboob ul Haq
Pseudo Codes
p = g (p).
Algorithmic steps
x∈[a,b]

ES-341:
Analysis
Mehboob ul Haq
Pseudo Codes
p = g (p).
Algorithmic steps
x∈[a,b]

Keep iterating: xi+1 = g (xi )
ES-341:
Analysis
Mehboob ul Haq
Pseudo Codes
p = g (p).
Algorithmic steps
x∈[a,b]

Until following criteria is met
ES-341:
Analysis
Mehboob ul Haq
Pseudo Codes
p = g (p).
Algorithmic steps
x∈[a,b]

|xi+1 − xi | ≤ ϵ
ES-341:
Analysis
Mehboob ul Haq
Pseudo Codes
p = g (p).
Algorithmic steps
x∈[a,b]

|xi+1 − xi | ≤ ϵ Or |g (xi ) − xi | ≤ ϵ else
ES-341:
Analysis
Mehboob ul Haq
Pseudo Codes
p = g (p).
Algorithmic steps
x∈[a,b]

|xi+1 − xi | ≤ ϵ Or |g (xi ) − xi | ≤ ϵ else

5 End procedure; xi+1 = p such that f (p) ≈ 0.
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq Newton Method algorithmic steps for solving f (x) = 0
(TA)
1 Let us consider f ∈ C [a, b]
Pseudo Codes
2 Calculate f ′ (x).
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
Keep iterating:
f (xi−1 )
xi = xi−1 −
f ′ (xi−1 )
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
Keep iterating:
f (xi−1 )
xi = xi−1 −
f ′ (xi−1 )
|xi − xi−1 | ≤ ϵ
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
Keep iterating:
f (xi−1 )
xi = xi−1 −
f ′ (xi−1 )
|xi − xi−1 | ≤ ϵ OR |f (xi )| ≤ ϵ else

5 End procedure; xi = p such that f (p) = 0 .
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq Secant Method algorithmic steps for solving f (x) = 0
(TA)
1 To solve the problem f (x) = 0 using Secant method.
Pseudo Codes
2 Choose two initial approximations x0 and x1 . .
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
2 Choose two initial approximations x0 and x1 . .Let us start iteration
counter with i = 2
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
counter with i = 2
Keep iterating:
f (xi−1 )(xi−2 − xi−1 )
xi = xi−1 −
f (xi−2 ) − f (xi−1 )
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
counter with i = 2
Keep iterating:
f (xi−1 )(xi−2 − xi−1 )
xi = xi−1 −
f (xi−2 ) − f (xi−1 )
|xi − xi−1 | ≤ ϵ
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
counter with i = 2
Keep iterating:
f (xi−1 )(xi−2 − xi−1 )
xi = xi−1 −
f (xi−2 ) − f (xi−1 )
|xi − xi−1 | ≤ ϵ Or |f (xi )| ≤ ϵ else

3 End procedure; xi = p such that f (p) = 0 .
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

Mehboob ul Haq Modified Newton algorithmic steps for solving f (x) = 0
(TA)
Pseudo Codes
1 Let us consider f ∈ C 2 [a, b],
2 Calculate f ′ ∈ C [a, b] and f ′′ ∈ C [a, b].
3 Consider an initial guess x0
Start iteration i = 1
f (xi−1 )f ′ (pi−1 )
xi = xi−1 −
(f ′ (xi−1 ))2 − f (xi−1 )f ′′ (xi−1 )
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
f (xi−1 )f ′ (pi−1 )
xi = xi−1 −
(f ′ (xi−1 ))2 − f (xi−1 )f ′′ (xi−1 )
|xi − xi−1 | ≤ ϵ
ES-341:
Numerical
Analysis
Dr. Mazhar Ali

(TA)
Pseudo Codes
f (xi−1 )f ′ (pi−1 )
xi = xi−1 −
(f ′ (xi−1 ))2 − f (xi−1 )f ′′ (xi−1 )
|xi − xi−1 | ≤ ϵ OR |f (xi )| ≤ ϵ else

4 End procedure; xi = p such that f (p) ≈ 0.

ES-341: Numerical Analysis: Dr. Mazhar Ali Mehboob Ul Haq (TA)

Uploaded by

Copyright:

Available Formats

ES-341: Numerical Analysis: Dr. Mazhar Ali Mehboob Ul Haq (TA)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ES-341: Numerical Analysis: Dr. Mazhar Ali Mehboob Ul Haq (TA)

Uploaded by

Copyright:

Available Formats

ES-341:

Dr. Mazhar Ali