Scribd
Upload
27 views1 page

Assignment #1 MEC 500 (Term 1 2009-10) Due: 2/03/2010 Problem 1 (40%)

This document outlines 6 problems to be solved for a course assignment. The problems involve using numerical methods like the bisection method, Newton-Raphson method, and linear approximation to find zeros of functions, determine rates of convergence, derive iterative formulas, and relate problems to Newton's method. Students are to find zeros of polynomials to a given accuracy, show the steps and intermediate values, describe their approaches, and explain concepts like rates of convergence for Newton-Raphson method.

Uploaded by

emanalkaph
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 DOC, PDF, TXT or read online on Scribd
27 views1 page

Assignment #1 MEC 500 (Term 1 2009-10) Due: 2/03/2010 Problem 1 (40%)

This document outlines 6 problems to be solved for a course assignment. The problems involve using numerical methods like the bisection method, Newton-Raphson method, and linear approximation to find zeros of functions, determine rates of convergence, derive iterative formulas, and relate problems to Newton's method. Students are to find zeros of polynomials to a given accuracy, show the steps and intermediate values, describe their approaches, and explain concepts like rates of convergence for Newton-Raphson method.

Uploaded by

emanalkaph
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 DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment #1

MEC 500 (Term 1 2009-10)

Due: 2/03/2010

Problem 1 (40%) x 4 + 2 x 3 7 x 2 + 3 has 2 positive and 2 negative zeros. (a) Using Bisection method, find all the negative zeros correct to 3 significant digits. For each zero, show the initial and all the intermediate pairs of points that are used as the bounds in each iteration of the Bisection method. (b) Using Newton-Rahpson method, find all of the positive zeros correct to 3 significant digits. For each zero, show the initial point, x0, all the intermediate points, x1, x2, , xn-1, and the value of the zero. Describe briefly the approach you take to select the initial points. Problem 2 (10%) Using methods of your choice, find all the zeros of f ( x ) = e 2 x 3e x + 2 . Problem 3 (10%) Using Newton-Rahpson method, find the zero of f ( x) = 10 x 3 + 29 x 2 +14.025 x 10.89 with x 0 = 1.5 accurate to 8 decimal places. (You don't have to show the intermediate values). At what rate does the sequence xn converge? Explain why the Newton-Rahpson method converges at such a rate. Problem 4 (20%) (a) When the sequence defined by the iterative formula x n +1 =
1 R ( x n + ) converges, what is 2 xn

the value of xn? [Note: R is a positive number.] (b) The iterative formula given in part (a) is derived from a function f(x) using the NewtonRahpson method. What is f(x)? Problem 5 (10%) Suppose f(x) is a function in which using Newton-Raphson method one can find the zero of the function in one iteration. What kind of function f(x) is? Problem 6 (10%) What linear function y = ax + b approximates f ( x ) = sin x best in the vicinity of x = / 4 ? How does this problem relate to Newtons method? -- END --

You might also like