在数学上,递推关系(recurrence relation),也就是(difference equation),是一种递推地定义一个序列的式:序列的每一项目是定义为前一项的函数。 举个.
基于346个网页-相关网页
linear recurrence relation 线性递推关系
recurrence relation detail 重现关系
recurrence relation matrix 递推关系矩阵
vector recurrence relation 三角递推关系
earthquake recurrence relation 地震重复关系
homogeneous recurrence relation 齐次递归关系
three-term recurrence relation 三项递推关系式
By transforming function specification, the recurrence relation of abstract problem-solving can be easily obtained.
利用规约进行变换,寻找递推关系,可以比较容易得到抽象算法。
参考来源 - 算法形式化推导及其在软件重用中的应用 in CLattice paths counting problem is one of important combinatorial enumerative problems. The lattice paths count- ing problems in 2-D plane are generalized to the 3-D space utilizing recurrence relation,thus obtaining some calculating for- mulas of lattice paths.
格路计数问题是组合计数中比较重要的问题之一,利用递推关系将几个二维平面中的格路计数问题推广到三维空间中,从而得出了一些新的格路计数公式。
参考来源 - 几个格路计数问题的推广·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
The solution to each of them could be expressed as a recurrence relation.
每个问题的解都能用递归关系表示。
The establishment of a recurrence relation in geometric convex set is the key to solve a problem.
几何凸集中递归关系的建立是求解问题的关键。
By transforming function specification, the recurrence relation of abstract problem-solving can be easily obtained.
利用规约进行变换,寻找递推关系,可以比较容易得到抽象算法。
All right, this is what's called a recurrence relation, there are actually cool ways to solve them. We can kind of eyeball it.
好,这就是所谓的递归关系,也就是解决问题的相当好的办法,我们可以来看看。
应用推荐