网络释义专业释义
电力安全论文 电力系统微机保护中开平方浮点算法的改进 关键词：开平方；迭代算法；微机保护分类号：TM [gap=304]Keywords：square root; iteration algorithm; microcomputer
基于42个网页-相关网页
【求解原理】9.1.4(1) Newton-Raphson（N-R）迭代法的原理 Newton-Raphson（N-R）迭代法(iteration algorithm)的主要思路是进行分步逼近计算，在 每一载荷增量步中，采用已得到的位移值带入并求得与位移相关的弹塑性矩阵的值，再进行 线性计...
基于4个网页-相关网页
reciprocal iteration algorithm 互反迭代算法
newton iteration algorithm 牛顿迭代算法
alternating projection iteration algorithm 交替投影叠代算法
bm iteration algorithm bm迭代算法
use iteration algorithm 利用迭代算法
-
迭代算法 - 引用次数：18
First of all, the approximate optimal value of the initial state can be acquired by using simulated annealing algorithm, and then this optimal value was taken as the initial value of the numerical iteration algorithm.
首先通过模拟退火算法计算出近似最优的系统初始状态值,并将此最优值作为数值迭代算法的初始值。
参考来源 - 单腿跳跃机器人的被动动力学研究 -
迭代算法 - 引用次数：3
This method has synthesized their merit, make least squares method resist colored noise, simultaneity provided good initial value to Newton iteration algorithm, finally enhance the degree of the model's precision, which have good reality applying value.
该方法综合了上述两种方法的优点,改善最小二乘法对噪声的敏感,给迭代算法提供较好的初值,最后得到的模型精确程度得到提高,具有很好的实际应用价值。
参考来源 - 燃烧控制系统的辨识技术研究及其控制系统仿真
·2,447,543篇论文数据，部分数据来源于NoteExpress
双语例句原声例句
-
The iteration algorithm to estimate shape parameter is first present.
首次提出一种迭代求取形状参数稳健估计的算法。
-
The iteration algorithm to estimate shape parameter was first presented.
首次提出了一种迭代求取形状参数稳健估计的算法。
-
The convergence of the inverse correlation matrix iteration algorithm is analyzed.
本文分析了逆幂迭代算法的收敛速度。
-
N But it's definitely not one and in fact it wasn't N in the case of Selection Sort because remember the algorithm we implemented on stage last week had me going back and forth across the stage selecting on iteration, the smallest person I can find, the smallest number and then putting them into place.
但在选择排序中，肯定不会是1，也不是,注意，上周我们在这儿,实现的算法中，反复地,迭代进行选择，选出最小的数,然后将其放在合适的位置。
-
> So now that might not have felt like the fastest algorithm but think about what you could have done with that algorithm in each iteration, much like the phonebook up front here, you literally split that problem in two because on each iteration roughly half of you were sitting down and then another half and then another half.
虽然这并不是最快的算法,但如果把这种算法每次迭代,就像刚才查电话簿一样，你便将这个问题一分为二了,因为每一次迭代后只有一半坐下来,以此类推。
-
And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.
在这个例子中，我们从8得到4，到2，再到1，是3次,在这个算法的每次迭代中，每一趟我都会操作N个数，也就是所我每次要做N步操作，一共要做，log，N，次。
应用推荐