查询词典 iteration

In the probabilistic model for wind farm, the uncertainties of wind speed is takes into account, and the real power injected and reactive power absorbed by the wind turbine are described as the function of the voltage magnitude, the slip of the induction machine and the circuit parameters of the wind turbines. In the unified iteration method, the slip of induction machine is introduced as the new correction value. The Newton-Raphson algorithm is used to solve the unified iteration of state variable and slip. Thus, the proposed method retains the quadratic convergence of the Newton-Raphson algorithm.

该风电概率模型考虑风速的随机性，将风机输出的随机有功功率和吸收的随机无功功率描述为电压幅值、异步机的滑差和风轮机的电路参数的函数；联合迭代方法中，异步风力发电机的滑差作为新的修正量被引入，使用牛顿-拉夫逊方法求解关于潮流状态变量和滑差的联合迭代，加热器因而迭代过程保持了牛顿-拉夫逊方法的平方收敛性。

A pattern of iteration calculation of voltage sag under load fluctuation is built to avoid the recalculation of power flow for each time of iteration, thus the calculation efficiency of the proposed algorithm is improved.

文中建立了负荷波动时的电压暂降迭代计算格式，避免了每次迭代时重新计算潮流，提高了算法的计算效率。

According to disadvantage of AS that the speed low of convergentiss and easily entering the stagnation,improving the AS in some aspect by the way that importing pheromone windows that the value of pheromone cannot exceed the window,only deposit the pheromone on the edge that belongs to the iteration shortest solution path,releasing additional pheromone to the edge belongs to the so-far shortest solution path,judging the situation of convergent and to reinitialize pheromone,optimizing the solutions by local search procedure at the end of every iteration,modifying the transition probability by add some problem specific parameters and so on.

本文主要运用蚁群优化算法(Ant Colony Optimization，ACO)来求解VRP。针对蚁群算法收敛性比较差，易于停滞的缺陷，通过使用信息素窗口限制、信息素的最大最小值，只更新信息素迭代中最好解，增加了精英的蚂蚁，信息素重新初始化之前先判断出汇聚情况，在每次迭代过程中加入局部的搜索进行优化，在对蚁群算法进行了优化时考虑选择概率当中加入与问题的相关参数等措施，从而使蚁群算法的收敛性得到大大提高，避免了算法的停滞现象。

For an objective comparison, the iteration numbers of these methods are: MLEM with 32iterations, OSEM with 4-subset 8 iterations and 2, 4, 8, 16, 20, 40-subset and 20 iterations, RAMLA with 4-subset and 8 iteration and relaxation parameter 0.5 and 1.5, respectively.

本研究取Inveon microPET扫描小鼠的正弦图，以MLEM、OSEM及RAMLA重建，MLEM叠代次数为32次；OSEM序列子集阶层为2、4、8、20、40，叠代次数为8、20次；RAMLA因定松弛系数为0.5、1、1.5，序列子集阶层4，叠代次数为8次。

In chapter one, firstly, we introduced several kinds of diagonally dominant matrices definition and their connection. Secondly, the relationship between those kinds of matrices and the convergence of some basic iteration methods (such as Jacobi, Seidel and SOR iteration methods) are also mentioned.

第一章，我们先简介了几类对角占优阵的定义及它们之间的关系，并介绍了一些基本迭代法(指Jacobi，Seidel及SOR迭代法等)的收敛性与这些矩阵类的关系。

The paper proposes a method which uses iteration learning control theory to design correction signal to self servo-writing loop. And the correction process can be used to conditions which precision model of plant can\'t be got. The convergence of iteration process can be proved by theory and experiments.

研究发现，自伺服刻写径向误差消除的过程很类似于迭代控制过程，提出用迭代学习控制算法设计自伺服刻写环路的校正信号，并从理论上证明该校正过程能够很好适应无法获取精确致动器模型的情况，证明了迭代过程的收敛性，实验证明径向误差得到较好抑制。

In this way,we can obtain the sequence of sub-iteration which is objectively suitable for the characters of multiple images to be encrypted. Based on this sequence,either an adjusting iteration after the whole iterations with the original sequence or completely changing the sequence of the whole iterations can be adopted.

根据这一次序，用完整迭代后附加调节性迭代的方法或者完全更换迭代次序的方法，都能够在保留基本算法快速收敛优势的前提下，使多幅解密图像质量以及系统地复用容量得以整体提高。

This paper discusses convergence of Ishikawa iteration sequence and existence of fixed points for set-valued nonexpansive mapping in uniformly covex Banach space, and the conditions are shown which guarantee the convergence of the iteration sequence to a fixed point.

讨论了δ集值非扩张映象在一致凸Banach空间中不动点非空的充分必要条件与Ishikawa迭代序列的收敛性及确保迭代程序收敛到不动点的条件，所得结果是单值非扩张映象的推广和发展。

On this basis,we explain how QR iteration converges to a block upper triangular matrix,and then state briefly the relationship between QR algorithm and simultaneous iteration.

在此基础上，我们阐明了QR迭代是如何收敛于块上三角阵的，并简明地说明了QR算法与同时迭代之间的关系。

In orderto improve the complex subspace iteration method for solving undamped gyroscopiceigenvalue problems, we apply the special properties of undamped gyroscopiceigenvalues to it, so we propose double inverse iteration method and double subspaceiteration method.

为了利用无阻尼陀螺特征值的特殊性质，我们进一步讨论了复子空间迭代法在无阻尼陀螺特征值问题中的应用，并给出了双逆迭代算法和双子空间迭代算法。

The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.

组2的心脏解剖困难，表现为纤维组织坚韧，游离肺动脉非常困难；徒手无法松解左、右纤维三角，肺动脉和主动脉根部的游离非常困难；心肌纤维坚硬、质脆，解剖时容易断离成碎块，无法沿纤维走行方向剥离。

We have battled against the odds in a province that has become increasingly violent.

我们对在一个争夺日益激烈省的可能性。