摘要
利用矩阵理论,对在第1、2项已知的条件下,具有递推关系a_(n+2)=k_1a_(n+1)+k_2a_n的线性递推关系数列,给出了一种直接用递推关系的系数所确定的特征方程的特征根判别敛散性的方法和具体的极限求法及其应用.
The author uses the matrix theory to work out a solution and its application of the Recurrence Relation Sequence, which is under the condition of the first two known items, just like：an＋2=k1an＋1＋k2an. The article directly use the correspondent root of the characteristic equation which the sequence correspondence to differentiate way of its collecting and diverging quality, gives out the solution of the concrete limit and its application.
出处
《云南民族大学学报（自然科学版）》
CAS
2008年第1期29-31,共3页
Journal of Yunnan Minzu University:Natural Sciences Edition
关键词
线性递推
数列极限
求法
应用
linear recursion
sequence limit
solution
application
