递归在haskell中至关重要。与命令式语言要求你去表达求解的方式不同，haskell更倾向于让你提供问题的描述。
Recursion is important to Haskell because unlike imperative languages, you do computations in Haskell by declaring what something is instead of declaring how you get it.
但是传统的微分等价递归算法精度低，并且利用数值差分来求解等价失效模式，计算量大。
But its computational accuracy is low, and the computational quantity is large when numerical difference is used to solve the equivalent failure mode.
本文论述了母函数与递归数列的关系，并探讨了用母函数求解递归数列的方法。
In this paper, we discuss the relation between master function and recursion, and the approach in solving recursive relation by master function.
几何凸集中递归关系的建立是求解问题的关键。
The establishment of a recurrence relation in geometric convex set is the key to solve a problem.
利用这些特性，对于求解较为复杂的线性递归关系提供了一种简单的方法。
Making use of these properties provides a simple and convenient solution for some more complex relationship of linear recursion.
圆满地解决了关系模式全部候选关键字的求解问题，具体地给出了以递归形式的求全部候选关键字的新算法。
The problem to find out all candidate keys of relation schema is solved satisfactorily. And a new recursive algorithm of finding out all candidate keys is given.
用标记每个搜索位置离起始位置最近距离的方法，通过递归函数求解，提出了一个对复杂迷宫的简明求解算法。
An algorithm is presented for complex maze by marking shortest path between the start point and current exploring point with recursive backtracking.
本文提出了一种用于求解高速VLSI和多芯片组件(MCM)中有耗互连线瞬态响应的稳定递归算法。
A stable recursive algorithm is presented for the transient simulation of interconnect systems in the high-speed VLSI and multichip modules (MCMs).
针对复杂管网水质比例矩阵求解困难的问题，利用递归方法求解水质比例矩阵，由此得到给定覆盖标准下的覆盖矩阵。
To resolve the computational complexity in water quality fraction matrix for complicated water distribution systems, a recursion method was used to obtain the coverage matrix under coverage criteria.
对孔明棋求解问题进行分析，提出了基于回溯思想的递归和非递归算法，运行结果表明了算法的有效性。
On the analysis of Kongming chess, proposes recursion and non-recursion algorithms based on backtrack for the issue, which works effectively.
该方法是基于最小相位滤波器的复倒谱系数和其群迟延函数以及其系统函数之间的关系，通过一个非线性的递归方程求解分母多项式的系数。
Based on the relationship between the group delay function and the cepstral coefficients, the denominator polynomial coefficients can be determined through a nonlinear recursive difference equation.
试用递归方法设计求解背包问题的算法。
Trial designed recursive algorithm for solving knapsack problem.
讨论了递归程序设计的公式化方法，指出现有方法的不足，并提出了一种新的基于求解状态的递归程序设计公式化方法，在一定程度上达到了递归程序设计公式化、简单化的目的。
Formula method of recursive programming is discussed. The imperfectness of the present method is pointed out, and a new formula method of recursive programming based on solving state is proposed.
讨论了递归程序设计的公式化方法，指出现有方法的不足，并提出了一种新的基于求解状态的递归程序设计公式化方法，在一定程度上达到了递归程序设计公式化、简单化的目的。
Formula method of recursive programming is discussed. The imperfectness of the present method is pointed out, and a new formula method of recursive programming based on solving state is proposed.
应用推荐