说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 减少递归关系
1)  reduced recurrence relations
减少递归关系
2)  recursion [英][ri'kə:ʒən]  [美][rɪ'kɝʒən]
递归关系
3)  recurrence relation
递归关系
1.
A new recurrence relation of the catalan number;
Catalan数的一个递归关系
2.
A general expression of Green s function in series with unknown coefficients in stratified media was provided firstly, and then those unknown coefficients were solved based on a technique by which a recurrence relation between layer and layer was developed using boundary condition and .
公式的推导是通过先给出分层结构中含待定系数无穷级数的格林函数通式 ,然后利用边界条件与源条件 ,得到层与层之间的递归关系进而求解这些系数 ,这样的解为分析屏蔽同轴圆柱分层介质结构提供了一种新的有效工
3.
In this article,we use iteration method to obtain the solution of some recurrence relations which contains two variables in combinatorial analysis,and the expression of multiple sums colulaling the solution of the recurrence relations has been proposed.
本文应用迭代法求解组合分析中一些二元递归关系,导出了得到它们的解的多重和算式。
4)  recursive relation
递归关系
1.
The study of Towers of Hanoi Puzzle on the recursive relation
基于递归关系下的Hanoi塔问题研究
2.
By using the recursive relation in combinatory,a new algorithm on the problem of the lock counting in the B question of Mathematical Modelling Contest in 1994 is presented.
利用组合数学中的递归关系给出了1994年全国大学生数学建模竞赛题B题关于锁具计数的新算法,锁具数的递归关系及通项公式,具有一般性。
5)  recurrence relations
递归关系
1.
Under the same Lipschitz condition as for Newton s method, the convergence of the deformation of Halley method is given, and a result on the existence of a unique solution for the nonlinear equation is given by using a technique based on a new system of recurrence relations.
在与Newton法收敛相同的Lipschitz条件下,通过使用一个新的递归关系,证明变形Halley法收敛,并给出了非线性算子方程的解的存在惟一性定理。
2.
Under new conditions, a convergence for Newton method is provided, and a result on the existence of a unique solution for the operator equation is given by using a technique based on a new system of recurrence relations.
在新的条件下 ,通过使用一种基于递归关系的新技巧 ,证明 Newton法收敛 ,并给出了算子方程的解的存在惟一性定
6)  Diminishing [英][di'miniʃ]  [美][də'mɪnɪʃ]
递减,减少
补充资料:递归关系


递归关系
recursive relation

  递归关系[reeur咖r创巨‘佣;pe叮pe。。。oe oTHooeowe] 关系(rehtion)R三N”,其中N是自然数集,使得在N”上由条件.厂(二1,…,二。)一{‘,女口果<、.,…,二>‘。, to,女口果(x、,…,x。>砖R定义的函数.f是一个递归函数(recurs阮丘川ction).特别是,对于任何”,全关系N”和零关系势都是递归关系.如果R和S是n元递归关系,则关系尺Us,尺自s,尺“=Nn\R,尺\S也是递归关系.关于运算口,门,〔’,所有n元递归关系的系统构成一个Boo】e代数(R刀kana」gebm). B.E.fl几HcKo撰杜小杨译
  
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条