Professional Documents
Culture Documents
Please refer to the project notes in the syllabus to make sure you receive full credit for this assignment.
The following three schemes can be used to recursively generate the terms in the
sequence [( 31 )n ]
n=0 :
1
rn = rn1
f or n = 1, 2, ,
3
4
1
1
and
pn = (pn1 ) (pn2 )
f or n = 2, 3, ,
p0 = 1, p1 =
3
3
3
1
10
q0 = 1, q1 =
and
qn = (qn1 ) qn2
f or n = 2, 3, ,
3
3
Were going to study how error is propagated in these three schemes.
r0 = 1 and
(1)
(2)
(3)
Analysis - 30%
1. By direct substitution verify that the general solution to (??) is given by
n
1
pn = A
+ B.
3
(4)
Hint: To start find pn1 and pn2 in terms of A & B. Plug these into (??) and simplify the results.
Note: Knowing that (??) is the general solution to (??) we can set A = 1 and B = 0
and generate the desired sequence.
2. Using a similar method to part ??, verify that the general solution for equation (??)
is given
n
1
qn = A
+ B3n
(5)
3
Again, knowing that (??) is the general solution to (??) we can set A = 1 and
B = 0 and generate the desired sequence.
3. Use section 1.3 and the October 3 Worksheet to characterize the algorithms error
for these 3 schemes. Youll need to use the general solutions that you verified
and then calculate the theoretical absolute error. When you describe the error use
terms including linear error or exponential error and provide justification for
this classification. Use the error that is introduced in the Computer Program section
for r0 , p1 and q1 to do these calculations (equations: (??), (??) and (??)).
Reminders
DUE DATE : October 13, 2014 (START OF CLASS) - Start early
In order not to loose point on your project, please refer to the Project Format notes
in the syllabus for Math 475.