1
Department of Mechanical Engineering
The University of Texas at Austin
ME 218
Engineering Computational Methods
Midterm Examination
Fall 2010
Instructor: Prof. Dragan Djurdjanovic
September 30, 2010
(8:00 am – 9:15 am)
Student Name:____Solutions_____
Student EID:___________________
Lab Section Number (or time):___________________
I have neither given nor received any unauthorized aid on this exam, nor have I
concealed any violations of the honor code.
Signature:____________________
Note: There are 3 problems.
Problem 1 carries 35 points, Problem 2 carries 25 points and Problem 3 carries 20 points.
There
are 80 points in total for you to win.
GOOD LUCK!!!
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document2
Problem 1: (35 points)
An engineer needs to solve the problem
This engineer has the codes for the following methods at his/her disposal:
•
NewtonRaphson’s method
•
Secant method
•
False position method
Initially, this engineer utilizes the Newton Raphson method to solve this problem but the
procedure diverged.
(a)
Given that the solution has been roughly located between 0.15 and 1, please suggest what
method the engineer should use next. Explain your answer. (5 points)
Using false position method the engineering is guaranteed that the solution interval will
converge, even if very slowly, towards the solution.
After iterating and obtaining a smaller
solution interval the engineer can go back to using another method, such as NewtonRaphson
to converge on the solution faster.
b)
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '08
 Unknown
 Mechanical Engineering, Gaussian Elimination, XR, Secant method, Rootfinding algorithm, False position method

Click to edit the document details