« previous | Tuesday, April 1, 2014 | next »
Exam Discussion
Perfect score is 102
Problem 1
and set
- If
, then show
. In this case ![{\displaystyle 1<{\sqrt[{3}]{2}}=g(1)\leq g(x)\leq g(2)={\sqrt[{3}]{3}}<2}](https://wikimedia.org/api/rest_v1/media/math/render/svg/767fc15367b6eb9c5b9111f1aea461d5b3e33086)

Solve
for
:
Problem 2
Interpolate polynomial using LaGrange method given all 4th-order divided differences (i.e.
are 10
x p(x)
-2 2
-1
0 0 1/3
0 5/3
1 0 7 10
14 ?
2 14 ?
?
? ?
Hence
Problem 3
Find Hermite polynomial
x p(x)
0 2
0
0 2 -1/4
-1/2 5/4
2 1 9/4
4
2 1
Problem 4
Taylor Series expansion given
,
, and
.
Thus
and
Problem 4
,
, and
Problem 5
On
, we have
and
.
Scale to new range
:
,
, and
Now shift to range
:
,
, and
this has
Quiz Discussion
for
Part A: Show Well-Posedness
- Continuous with respect to


Part B: List methods
Euler's method:
,
Modified Euler's method:
,
Part C: Euler Approximation



Numerical Linear Algebra
Practical problem: solve
many times given
,
, etc.
Naïve method
Compute
.
When
comes along, compute
. The cost is
to compute
plus
to multiply
by
Smarter Method
Perform gaussian elimination on
, keeping track of each elementary matrix operation:
,
,
, etc.
We will be left with
, where
is an upper-triangular matrix. Solving once again for
(i.e. finding
gives a lower triangular matrix
This gives
, the LU-decomposition of
.
It costs
operations to decompose an
matrix
.
We store
inside
:
When
comes along, we have
.
- Solve
for 
- Solve
for 
each takes approximately
operations to solve, so our total cost is now