离散数学杨争锋ch062.pptxVIP

(2) Example 1 (page 413) (i) Pn=(1.11)Pn-1 a linear homogeneous recurrence relation of degree one. (ii) fn=fn-1+fn-2 a linear homogeneous recurrence relation of degree two (iii) an=an-5a linear homogeneous recurrence relation of degree five 牛牛文库文档分享 (3) Example 2 (page 413) (i) an=an-1+an-22 not linear (ii) Hn=2Hn-1+1not homogeneous (ii) Bn=nBn-1not have constant coefficients 牛牛文库文档分享 2. Solving Linear Homogeneous Recurrence Relations with Constant Coefficients Introduction For the recurrence relation: an=c1an-1 + c2an-2 + …… + ckan-k Look for the solution of the form an=rn where r is a constant. 牛牛文库文档分享 Way: rn=c1rn-1 + c2rn-2 + …… + ckrn-k Then, we have: rk-c1rk-1 - c2rk-2 - …… - ck-1r - ck = 0 The sequence {an} with an=rn is a solution if and only if r is the solution of the last equation (characteristic equation, 特征方程). The solutions of this equation are called the characteristic roots (特征根) of the recurrence relation. 牛牛文库文档分享 (2) Theorem 1 (page 414) Let c1 and c2 be real numbers. Suppose that r2-c1r-c2=0 has two distinct roots r1 and r2. Then the sequence {an} is a solution of the recurrence relation an=c1an-1+c2an-2 if and only if an=α1r1n+ α2r2n for n=0,1,2,…., where α1 and α2 are constants. 牛牛文库文档分享 Proof: We must do two things to prove the theorem: (a) First, it must be shown that if r1 and r2 are the roots of the characteristic equation, and α1 and α2 are constants, then the sequence {an} with an=α1r1n+ α2r2n is a solution of the recurrence relation. 牛牛文库文档分享 (b) Second, it must be shown that if the sequence {an} is a solution, then an=α1r1n+ α2r2n for some constants α1 and α2. For the details, please see page 414. 牛牛文库文档分享 (3) Example 3 (page 415) What is the solution of the recurrence relation an = an-1+2an-2 with a0=2 and a1=7? Solutio