MA393-A Numerical Analysis

2006 Fall Take-Home Midterm 2

Issued at 10/10/2006 1:50PM

Due at 10/20/2006 1:00PM

Each problem is worth 3 turkeys.

1. A car laps a race track in 84 seconds. The speed of the car at each 6-seconds interval is
determined using a radar gun and is given from the beginning of the lap, in feet/second,
by the entries in the following table:
Time 0 6 12 18 24 30 36 42 48 54 60 66 72 78 84
Speed 124 134 148 156 147 133 121 109 99 85 78 89 104 116 123
How long is the track? R1
2. Romberg integration for approximating 0 f (x) dx gives R11 = 4 and R22 = 5. Find
f (0:5).
3. In statistics course, it is shown that
Z 1
1 1 x 2
p e 2 ( ) dx = 1
1 2
for any positive . The function
1 1 x 2
f (x) = p e 2 ( )
2
is the normal density function with mean = 0 and standard deviation . The probability
that a randomly chosen value describled by this distribution lies in [a; b] is given by
Rb
a
f (x) dx. Approximate to within 10 5 the probability that a randomly chosen value
describled by this distrobution will lie in [ 2 ; 2 ].
4. Use the recurrence relation
n2
Pn+1 (x) = xPn (x) Pn 1 (x) , for each n 1,
4n2 1
where P0 (x) = 1 and P1 (x) = x, to derive the Legendre polynomials P2 (x), P3 (x) and
P4 (x).
5. Suppose that A and B are positive de…nite n n matrices. Which of the following must
also be positive de…nite?
(a) A
(b) AT
(c) A + B
(d) A2
(e) A B
1
2

F For problems 6-12, consider the four 4 4 linear systems Ax = bi for i = 1; 2; 3; 4 having
the same coe¢ cient matrix
2 3
6 2 1 1
6 2 4 1 0 7
A=6 4 1
7
1 4 1 5
1 0 1 3
and 2 3 2 3 2 3 2 3
2 6 0 1
6 1 7 6 7 6 7 6 0 7
b1 = 6 7 , b2 = 6 4 7 , b3 = 6 1 7 , and b4 = 6 7.
4 0 5 4 5 5 4 3 5 4 0 5
1 3 0 1
6. Solve the linear systems by applying Gaussian elimination to the augmented matrix
2 3
..
6 6 2 1 1 . 2 6 0 1 7
6 .. 7
6 2 4 1 0 . 1 4 1 0 7
6 .. 7.
6 1 1 4 1 . 0 5 3 0 7
4 5
..
1 0 1 3 . 1 3 0 1
7. Solve the linear systems by …nding and multiplying by the inverse of A.
8. Solve the linear systems by …nding and applying by the LU -decomposition of A.
9. Solve the linear systems by …nding and applying by the LLT -decomposition of A.
10. Solve the linear systems by …nding and applying by the LDLT -decomposition of A.
11. Solve the linear systems by …nding and applying an orthogonal matrix Q such that D =
QT AQ where D is a diagonal matrix.
12. Compare six methods in Problem 6-11 in actual execution time by repeating each method
10000 times. Which one is fastest? Which one is slowest?