Scribd
Upload
94 views5 pages

Numerical Analysis PDF

This document contains a 10 question numerical analysis exam. It instructs students to sign a pledge, complete 8 out of the 10 questions for full credit, and provides tables and functions for the questions. The questions cover topics like root finding using bisection and Newton's methods, interpolation, numerical integration using Simpson's rule, and solving differential equations.

Uploaded by

Saad Latif
Copyright
© Attribution Non-Commercial (BY-NC)
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
94 views5 pages

Numerical Analysis PDF

This document contains a 10 question numerical analysis exam. It instructs students to sign a pledge, complete 8 out of the 10 questions for full credit, and provides tables and functions for the questions. The questions cover topics like root finding using bisection and Newton's methods, interpolation, numerical integration using Simpson's rule, and solving differential equations.

Uploaded by

Saad Latif
Copyright
© Attribution Non-Commercial (BY-NC)
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

Numerical Analysis/Exam #1/Spring 2013

NAME:

Sign the following pledge:

On my honor, I have neither received nor given any unauthorized assistance on this examination.

SIGNATURE: DATE:

For full credit, you must show your work. Answer 8 out of 10 questions. Cross out the questions you do not want to have graded. Each question is worth 10 points. Total points: 80. 1. Let f (x) = x3 3x2 + 3. (a) Show that f has a root in the interval [0, 2]. (b) Show that this root is unique. (c) Use the bisection method to nd this root with error less than 0.1.

2. Find the minimum number of iterations of the bisection method with initial bracketing interval [0, 2] that would be required to nd a root with error less than 108 .

3. (a) Let f (x) = x3 3x2 +3. Apply Newtons method with initial estimate p0 = 1 to generate a sequence of estimates p1 , p2 , . . . , p5 for a root of f . You need only write down p5 . (b) The function f (x) = (x2 4) cos x has roots at 2 and 2 (among others). Characterize the convergence of Newtons method to each of these roots.

4. A function f is given by the following table of values: x 0 2 3 f ( x) 8 6 8

Find the Lagrange interpolating polynomial for this data.

1.0

5. With n = 4, use Simpsons rule to estimate


0.6

ex dx.

1.0

6. Simpsons rule is to be used to estimate


0.6

ex dx. Find the minimum

value of n that guarantees the error is less than 108 .

7. Complete the following table, using the most appropriate 3-point formulas to estimate f and f . x 2.0 2.2 2.4 2.6 f (x) 5.00 5.02 5.16 5.54 f (x) f ( x)

8. Consider the heat equation ut = uxx for u(x, t) on the region 0 x 4, t 0, with boundary conditions u(0, t) = 0 = u(4, t), and initial condition u(x, 0) = 16x(4 x). Solve the equation taking x = 1, t = 1/4, and calculate 4 t-steps (up to t = 1). Put your answers in the table.

9. Suppose x0 < x1 , with x1 = x0 + h. Let f be a function with f (x0 ) = f0 , f (x1 ) = f1 . (a) Find the Lagrange interpolating polynomial L for the data (x0 , f0 ), (x1 , f1 ). (b) Find an estimate for f (x0 ) by calculating L (x0 ).

10. Let f (x) = x 3 , which has a unique root at x = 0. Show that for any starting value p0 = 0, Newtons method does not converge to this root.

You might also like