1) multiple roots
多重根
1.
Using this method,it converges linearly to multiple roots and if we known the multiplicity,it converges quadratically to multiple roots,Moreover,it is shown that if you using this method to get the multiple roots of nonlinear equation,its power exponent should be smaller,then it can convergent more quickly.
讨论用建立在幂平均基础上的牛顿法求解方程的多重根的收敛性问题,证明了用此方法求解方程重根是线性收敛的,并且若知道了根的重数,可改进其迭代公式使其二阶收敛,同时该文结论部分说明了用幂平均牛顿法求解方程的多重根时,幂指数越小,收敛速度越快。
2) multiple directed rooted trees
多重有向根树
1.
define a multiplication operation between multiple directed rooted trees (denoted by ) and points out that the multiplication operation of finite directed rooted trees is also a directed rooted tree.
在此把这种运算推广到多重有向根树上,证明了这种运算对多重有向根树的封闭性,并证明了有限个多重有向根树经这种运算后为一棵有向根树当且仅当每个多重有向根树为一棵有向根树。
3) Root-MUSIC
求根多重信号分类
1.
Harmonic and Interharmonic Spectrum Estimation Based on Root-MUSIC and GA;
基于求根多重信号分类和遗传算法的谐波间谐波频谱估计
4) root weight
根重
1.
Effect of seeding-year clipping frequency on root weight and yield in alfalfa and brome grass mixture swards;
刈割对混播草地根重及翌年产草量的响应
2.
Preliminary research on relationship between boron content and root weight and sugar content in sugarbeet root;
甜菜块根中硼元素含量与其根重和含糖率关系的初步研究
3.
Law of ginseng root weight changes during ginseng growth was tested by the field experiment from 1993 to 2001.
通过田间试验,对1993-2001年人参生长过程中根重变化规律进行了研究,并采用数学模拟的方法,对参根增重过程中某些数量规律和特点进行了分析。
5) multiple root
重根
1.
This paper brief introduce numerical method of algebraic equation,points out their shortcoming of missing multiple root and put forward one new kind of method--multiple derivation numerical method.
本文对通常代数方程的数值计算方法特点进行了简介并给以分析 ,指出了这些解法无法得出重根数的缺陷 ,提出了一种新的解决方法———多次求导数值计算法 ,使得数值计算法更加清晰、明了 ,且可得出重根数。
2.
The improvement can maintain the speed of the original convergence and is still effective when there are multiple roots.
对牛顿 (Newton)求根公式作了改进 ,使其对重根情况仍有效 ,并保持原有的收敛性
3.
Give out the distinguish theorem of multiple root based on maximum value.
根据导函数的极值分析实根的分布情况、迭代区间和迭代初值,利用三次收敛的迭代方法求解方程的实根,给出了根据极值的重根判别定理。
6) repeated root
重根
1.
In order to get the λ repeated roots of equation f(x) = 0, where λ∈R~+ and the equation may be underivative, an generalized Newton iterative method was constructed with order 2 as its convergence.
设方程f(x)=0有λ重根,其中λ为任意正实数,函数f(x)可能不可导,给出了求这一类方程的λ重根的一个广义Newton迭代法,并证明了这种方法的收敛阶为2。
2.
The roots of these equations in the E,are completely given,that is,they have(n,pk-1)-1 single roots or(n,pk-1) distinct groups of repeated roots,and they have no roots.
完整地给出了这些方程在E中的根的状况:(n,pk-1)-1个单根,(n,pk-1)组互不相同的重根,没有根。
3.
The author completely gives the roots of these equations in the F,that is,they have (n,p~k-1)-1 single roots or (n,p~k-1) distinct groups of repeated roots,and they have no root.
本文完整地给出这些方程在F中的根的状况:(n,pk-1)-1个单根,(n,pk-1)组互不相同的重根,没有根。
补充资料：无根树
【无根树】
（杂名）七女经曰：“七女告帝释曰：愿与我辈愿，帝释许诺。一女曰：我愿欲得无根无枝无叶树。”
（杂名）七女经曰：“七女告帝释曰：愿与我辈愿，帝释许诺。一女曰：我愿欲得无根无枝无叶树。”
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条