0% found this document useful (0 votes)
38 views2 pages

MTH 510 - Numerical Analysis Assignment 1: Spring 2014

This document contains instructions for Assignment 1 of the numerical analysis course MTH 510. It includes 7 problems related to numerical analysis topics like machine epsilon, binary representation, Maclaurin series, polynomial evaluation, root finding, and condition numbers. Students are asked to complete tasks like determining the machine epsilon in single precision format, evaluating functions at given values, finding roots graphically and numerically using bisection and Newton's methods, and interpreting condition numbers. They are also provided references to sections in the textbook for additional review.

Uploaded by

Winsle An
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)
38 views2 pages

MTH 510 - Numerical Analysis Assignment 1: Spring 2014

This document contains instructions for Assignment 1 of the numerical analysis course MTH 510. It includes 7 problems related to numerical analysis topics like machine epsilon, binary representation, Maclaurin series, polynomial evaluation, root finding, and condition numbers. Students are asked to complete tasks like determining the machine epsilon in single precision format, evaluating functions at given values, finding roots graphically and numerically using bisection and Newton's methods, and interpreting condition numbers. They are also provided references to sections in the textbook for additional review.

Uploaded by

Winsle An
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/ 2

Spring 2014 1

MTH 510 -NUMERICAL ANALYSIS


Assignment 1
Due Date: May 26, 2014
1. Knowing the bit structure of IEEE single precision arithmetic (the sign is 1 bit long, the
mantissa is 23 bits long, and the exponent has 8 bits), what is the machine epsilon in IEEE
single precision format? Show your work. Verify your result with MATLAB s machine epsilon
in single precision arithmetic.
2. Determine the binary representation of the following decimal number: 108.8203125.
3. Find the MacLaurin series for f(x) = ln(1 + x). Beginning with the rst term of the series,
add terms one at a time to estimate ln(1.01).
a) After adding each term, compute the true and the approximate percent relative errors.
b) Continue the iterative process of adding one term at a time until the approximate percent
relative error falls below an error criterion for 4 signicant gures (by hand).
4. Evaluate the polynomial f(x) = x
3
8x
2
+ 5x 0.785
(a) at x=1.37. Use 3 digit arithmetic with chopping. Evaluate the relative error
(b) Repeat (a) but express f(x) = 0.785 + x(5 + x(8 + x))
5. Evaluate and interpret the condition numbers for f(x) = e
x
; for x = 1.0001
6. Consider the function
f(x) = 2.75x
3
+ 18x
2
21x 12
a) Plot the graph of f(x) in MATLAB and nd all the roots of the function f(x) graphically.
Provide the code and the plot you obtained.
b) Compute by hand the rst root of the function with the bisection method, on the interval
[-1; 0] for a stopping criterion of 1%.
c) How many iterations on the interval [-1, 0] are needed with the bisection method to obtain
the true error of the rst root less than 10
8
?
d) Find all the roots applying MATLABs built-in procedure. Include the MATLAB code
used and the output obtained.
7. Given the function
f(x) = e
x
+ x 7;
nd the real root of f(x) = 0
a) applying 3 iterations of the Newtons method (by hand) with an initial guess x
0
= 1.
b) applying 3 iterations of the secant method (by hand) with initial guesses x
0
= 1 and
x
1
= 2.
c) Find the root applying MATLABs built-in procedure.
Spring 2014 2
Chapter Sections Questions (Not to be handed)
Ch 2: Sec. 2-2.5; 2.1-2.4, 2.11, 21.5
Ch 3: Sec. 3.1-3.5; 3.1, 3.12-3.14
Ch 4 : Sec. 4.1-4.4 (omit 4.3.4 and 4.4.1; 4.1-4.3, 4.5, 4.7, 4.8, 4.109
Ch 5: Sec 5.1, 5.2, 5.4; 5.1, 5.7, 5.8a, 5.14, 5.16a
Ch 6: Sec. 6.2-6.5; 6.2,6.4, 6.5, 6.12, 6.16, 6.22, 6.27, 6.28

You might also like