0% found this document useful (0 votes)
51 views5 pages

Lecture 08-20220822

The document discusses a quiz for the Numerical Methods course. It provides details about the quiz such as the date, duration, topics covered, and exam format. It also discusses homework assignments and common mistakes students make. Additionally, it reviews numerical methods for finding roots of nonlinear equations, including the bisection method, Newton's method, and Muller's method. Examples are provided and the instructor encourages students to work through sample problems together during class.

Uploaded by

Kundan karn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views5 pages

Lecture 08-20220822

The document discusses a quiz for the Numerical Methods course. It provides details about the quiz such as the date, duration, topics covered, and exam format. It also discusses homework assignments and common mistakes students make. Additionally, it reviews numerical methods for finding roots of nonlinear equations, including the bisection method, Newton's method, and Muller's method. Examples are provided and the instructor encourages students to work through sample problems together during class.

Uploaded by

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

29‐08‐2022

Quiz ‐ 1

CE‐603  Quiz – 1:
Thursday, August 25, 2022
Numerical Methods For 1 hour during class hours
Mohammad Rafiq ([email protected])
oExam will be conducted in class room.
Prof. Ravi Sinha ([email protected])
oExam will be closed‐book.
Lecture 08 – Monday, August 22, 2022 oQuestion paper may include a mix of theoretical and numerical questions.

CE‐603 Numerical Methods | Autumn Semester 2022‐23 2

Quiz ‐ 1
Exam Topics:
oMathematical Background
oComputer Representation of Numbers
oErrors in Numerical Computations
Review of Homework & 
oStability of Algorithms
oRoots of Nonlinear Equations
Problem Session
o Single equation
o Simultaneous equations

CE‐603 Numerical Methods | Autumn Semester 2022‐23 3 CE‐603 Numerical Methods | Autumn Semester 2022‐23 4
29‐08‐2022

Homework 1 Homework 2
oProblem Statement oProblem Statement

o Let’s go through the model solution together! o Let’s go through the model solution together!

CE‐603 Numerical Methods | Autumn Semester 2022‐23 5 CE‐603 Numerical Methods | Autumn Semester 2022‐23 6

Some Common Mistakes in Your Homework Recommendations
o You calculate everything but don’t present your results or presented results are not  o Go through the model solutions available on Moodle. Compare your solutions and scripts 
explanatory and note down where you could have done much better.
o Hard‐coding: Don’t worry, you will get over this with time o Feel free to fiddle around with these codes and exploit them to improve your skills.
o Zero or insufficient commenting in the program. o Use standard naming conventions.
o Involving too much user intervention o Documentation of results.
o Program does not execute, either you make changes in the program and do not retest the  o Code should do what is asked for and be easy to test, extend and reuse.
program or make the file name invalid for submission
o Try interpretation of results (whatever you get) and making sense out of it.
o Insufficient observations and comments from the results of your homework

CE‐603 Numerical Methods | Autumn Semester 2022‐23 7 CE‐603 Numerical Methods | Autumn Semester 2022‐23 8
29‐08‐2022

Bisection Method – A Review
f(x) is continuous on a given interval [a, b] and it also satisfies f(a)  f(b) < 0, then f(x) must 
have at least one root in the interval [a, b].

Roots of Nonlinear  Algorithm for Bisection:
Step (1) Define c=(a+b)/2

Equations
a c1
c2 b Step (2) If (bc)  , accept root = c and exit
Step (3) If sign[f(b)]  sign[f(c)]  0, then a = 
c;
otherwise b = c
Step (4) Return to Step (1)

CE‐603 Numerical Methods | Autumn Semester 2022‐23 9 CE‐603 Numerical Methods | Autumn Semester 2022‐23 10

Bisection Method – An Example Review of Newton Method


o Find the real root of the following polynomial between 0 and 2 using Bisection method.  Assume that an estimate x0 is known close to the desired root, . Since x0 is assume close 
Carry out at least four iterations in the class.  to , approximate the curve by a straight‐line tangent to f(x) at x = x0. 
The root of this tangent line will be the new approximation of .

o Time allotted = 5 minutes
f (xn )
x n 1  x n  n0
o Let’s solve the problem together on board f (xn )
x2 x1 x0

CE‐603 Numerical Methods | Autumn Semester 2022‐23 11 CE‐603 Numerical Methods | Autumn Semester 2022‐23 12
29‐08‐2022

Newton Method – An Example Review of Muller’s Method


o Find the real root of the same polynomial solved earlier using Newton’s method. Take  This method can be used to find both real and complex roots of a nonlinear function.
initial guess and carry out at least four iterations in the class. 
If three points on the function, x0, x1 and x2 are known, a quadratic polynomial (parabola) is 
constructed through (xi, f(xi)). One of the roots of the polynomial is taken as the next 
estimate of the true root, .
o Time allotted = 5 minutes  x0 , x1 , x2 
The quadratic polynomial through the 3 points                      is expressed as:
p(x)  f ( x2 )  (x  x2 ) f [ x2 , x1 ]  (x  x2 )(x  x1 ) f [ x2 , x1 , x0 ]
o Let’s solve the problem together on board where,  f (x1 )  f ( x0 )
f [ x0 , x1 ] 
o Try at your place; different roots of  x1  x0
f [ x1 , x2 ]  f [ x0 , x1 ] f ( x2 )  f ( x1 ) f (x1 )  f (x0 )
f [ x0 , x1 , x2 ]   
x2  x 0 ( x2  x0 )(x2  x1 ) (x2  x0 )(x1  x0 )
CE‐603 Numerical Methods | Autumn Semester 2022‐23 13 CE‐603 Numerical Methods | Autumn Semester 2022‐23 14

Review of Muller’s Method Muller Method – An Example


To find zeros of the quadratic polynomial, we define: o Find the real root of the following polynomial using Muller’s method. Carry out at least 
four iterations in the class.
y  p( x)  f (x2 )  w( x  x2 )  f [ x2 , x1 , x0 ](x  x2 ) 2

oTake initial guesses as 
w  f [ x2 , x1 ]  (x2  x1 ) f [ x2 , x1 , x0 ]
 f [ x2 , x1 ]  f [ x2 , x0 ]  f [ x0 , x1 ]

The smallest value of x  x2 must be found that satisfies the equation y0. o Time allotted = 10 minutes


The root is given by:
2 f (x2 ) o Let’s solve the problem together on board
x 3  x2 
w  w 2  4 f (x2 ) f [ x2 , x1 , x0 ]

The sign in 2nd term is chosen to maximize the magnitude of denominator.
CE‐603 Numerical Methods | Autumn Semester 2022‐23 15 CE‐603 Numerical Methods | Autumn Semester 2022‐23 16
29‐08‐2022

Homework Queries Summary
o HW3 – Ritik Dhalwani oReview of Homework solutions
o HW4 – Naqeeb ul Islam oProblem solving session
oHW5 – Mohammad Rafiq oQuiz 1 Reminder (August 25, 2022 @ 5:30 PM)
o HW6 – Mudit Agarwal

CE‐603 Numerical Methods | Autumn Semester 2022‐23 17 CE‐603 Numerical Methods | Autumn Semester 2022‐23 18

Next Lecture (L‐09)
The next lecture on Thursday, August 25, 2022 (Quiz 1).

End of Lecture 08

CE‐603 Numerical Methods | Autumn Semester 2022‐23 19 CE‐603 Numerical Methods | Autumn Semester 2022‐23 20

You might also like