5-9-8

 

 

Graphing a Recursion Formula

Example

To draw the WEB graph for the recursion formula an+1 = –3(an)2+ 3an,

 

bn+1 = 3bn + 0.2, and check for divergence or convergence. Use the

 

following table range and V-Window Settings.

 

Table Range

 

 

Start = 0, End = 6, a0 = 0.01, anStr = 0.01, b0 = 0.11, bnStr = 0.11

 

V-Window Settings

 

 

Xmin = 0,

Xmax = 1,

Xscale = 1

 

Ymin = 0,

Ymax = 1,

Yscale = 1

Procedure

1m RECUR

2!3(V-WIN)awbwbwc awbwbwJ

33(TYPE)2(an+1)-d2(an)x+d2(an)w d3(bn)+a.cw

45(SET)1(a0)

awgwa.abwa.bbwc a.abwa.bbwJ

56(TABL)

64(WEB)

7w~w(an is convergence) cw~w(bn is divergence)

Result Screen

20050401