递推方程的两种特殊解法及其在程序设计中的应用  

Two Special Solutions to Recursive Equation and its Application in Programming

作　　者：金渊智[1] JIN Yuanzhi(Department of Computer Technology and Information Engineering,Sanmenxia Polytechnic,Sanmenxia 472000,China)

机构地区：[1]三门峡职业技术学院信息传媒学院,河南三门峡472000

出　　处：《安阳工学院学报》2019年第2期84-86,共3页Journal of Anyang Institute of Technology

基　　金：国家自然科学基金(71502021)

摘　　要：首先分析了常系数线性递推方程的一般解法。接着根据幂级数与生成函数的关系,将生成函数用于递推方程的求解。最后通过对经典问题——Hanoi塔的例子,利用MATLAB仿真,对递归和非递归程序的执行效率进行了比较,验证了求解递推方程的必要性。First of all, the general solution of linear recurrence equation with constant coefficients is analyzed. Then, according to the relation between power series and generating function, the generating function is applied to solve the recursive equation. Finally, the implementation efficiency of recursive and non-recursive programs for classical problem-Hanoi is compared. The MATLAB simulation results indicate that it is necessary to solve the recurrence equation.

关 键 词：递归 递推方程 程序设计 算法分析 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]