A SERVICE OF

logo

Open as PDF
next previous
20070201
Example To draw the WEB graph for the recursion formula
a n+1 = –3( a n)
2
+ 3 a n,
b n+1 = 3 b n + 0.2, and check for divergence or convergence. Use the
following table range and V-Window settings.
Table Range
Start = 0, End = 6,
a 0 = 0.01, a nStr = 0.01, b 0 = 0.11, b nStr = 0.11
V-Window Settings
Xmin = 0, Xmax = 1, Xscale = 1
Ymin = 0, Ymax = 1, Yscale = 1
Procedure
1 m RECUR
2 !3(V-WIN) awbwbwc
awbwbwJ
3 3(TYPE)2(
an+1)-d2(an)x+d2(an)w
d3(
bn)+a.cw
4 5(SET)1(
a0)
awgwa.abwa.bbwc
a.abwa.bbwJ
5 6(TABL)
6 4(WEB)
7 w~w(
an is convergence)
cw~w(
bn is divergence)
Result Screen
5-9-8
Graphing a Recursion Formula