在数学上,递推关系(recurrence relation),也就是(difference equation),是一种递推地定义一个序列的式:序列的每一项目是定义为前一项的函数。 举个.
基于358个网页-相关网页
By transforming function specification, the recurrence relation of abstract problem-solving can be easily obtained.
利用规约进行变换，寻找递推关系，可以比较容易得到抽象算法。
参考来源 - 算法形式化推导及其在软件重用中的应用 in C·2,447,543篇论文数据，部分数据来源于NoteExpress
母函数是研究用递推关系来确定的函数的最理想工具。
Generating functions are an ideal tool for studying sequences defined by recurrence.
利用规约进行变换，寻找递推关系，可以比较容易得到抽象算法。
By transforming function specification, the recurrence relation of abstract problem-solving can be easily obtained.
文中根据检测似然比序列的特点，利用递推关系，提出了一种快速算法。
Based on the characteristics of the detection likelihood ratio sequence and the recursive relations, a fast algorithm is proposed.
应用推荐