迭代次数

The quantum amplitude amplification is the generalization of quantum Grover search algorithm. In this strategy, the Grover iteration has been replaced by two different quantum amplitude amplification operations. This makes it possible to collapse the system with probability 1, in other words, with certainty. The measurement operation in this scheme is only used to cancel the phase factor. Finally, one can use the admissible control to drive the system from the eigenstate to the target state and the control task is accomplished.

量子幅值放大是Grover迭代思想的一般化，该控制方案中采用两种不同的量子幅值放大操作替换了Grover迭代，使得期望本征态的概率幅的模在经过一定次数的迭代之后精确的等于1，然后借助于测量来消除相位因子，使系统的波函数确定性的塌缩到期望的本征态，最后再借助幺正演化，将系统从本征态控制到目标态，实现期望的控制任务。

First, one. analyzes the eigenstates-from reachable sets and seeks the one which the target state belongs to. Then using the Grover iteration to amplify the probability amplitude of the desired eigenstate (the modul square of which is the probability of the corresponding eigenstate that the system will collapse to when it is measured). By measuring, the system will then collapse to the desired eigenstate with a probability of almost unity. Finally, one can use the admissible control to drive the system from the eigenstate to the target state.

该策略的核心思想是对本征态能控的系统，通过分析控制目标态与本征态的关系，寻找给定目标态所属的本征态可达集，然后利用量子非结构化搜索的Grover算法，将任意给定的系统初始态经过一定次数的Grover迭代，放大该本征态所对应的概率幅(概率幅的模方对应测量时波函数塌缩到对应本征态的概率)，然后对迭代后的态进行一次测量操作，使系统以接近1的概率塌缩到所需的本征态(前面分析得到的本征态可达集所对应的本征态)，最后用容许的控制将系统从该本征态控制到期望的目标态。

The proposed algorithm use the related deduction of division with reminder of polynomials and the key equation is solved by column transformation of matrix. Then the formula of quotient and reminder can be got quickly which can reduce the times of iterative operation.

该算法利用多项式带余除法的相关推论，通过矩阵的列变换来求解关键方程，这样可以快速地得到商式和余式，从而可以减少迭代运算的次数。

The rolling effects of horizontal and edger rolls were both taken into account during load distribution, and iterative computations were done alternately along the width and thickness of work piece by virtue of the equal load function to optimize the rolling schedule step by step.

分配时兼顾水平辊和立辊轧制的影响，在宽度和厚度两个方向进行等负荷函数的交替迭代计算，逐步优化规程，并在外层迭代中设置了机组轧制负荷超限情况下的道次数自动修正。

Then we use Cramer\'s rule to obtain an estimate of the degree in q~(1/2) of the leading coefficient of the recurrence.

而后利用Cramer法则得到迭代关系首项系数中q~(1/2)的次数的一个估计。

By studying the spectrum properties of coefficient matrix and the regular parameters at the iterative procedure of the first class regular method , we assign a uniform parameter for the inner iteration . Simulation results show that this method for choosing regular parameter is correct and the outer iterate convergence for high contrast object.

这两种方法的正则化效果取决于迭代的次数，我们通过对静态正则化方法中逆散射方程系数矩阵的谱特性、正则化参数等进行分析，对这类迭代正则化方法选取了统一的正则化参数，使得外部迭代方法收敛。

Assuming that there is a plural Z and , with the following iterative calculation : Z = Z2 +, because the value of different , after several iteration number Z after the amplitude may tend to infinity. May also maintained sector, Mandebo Lott who is set to make Z maintained sector pool put on the complex plane make the distribution of images, as demonstrated above in the extremely complex structure.

假设有复数Z和μ，用下式迭代计算：Z=Z2＋μ，由于μ的取值不同，经过若干次数迭代以后Z的幅值可能趋向无穷，也可能保持有界，曼德勃罗特集就是那些使Z保持有界的μ的集合，把μ在复平面上的分布作成图像，就像上面演示的那样具有极其复杂的结构。

In this paper, the generator model of constant transient voltage and the invariableness impedance model was used, and the saliency of generator is included; through the analysis of the characteristic of the network equation calculation in the transient stability analysis, a new node ordering algorithm is proposed. Better initial value can accelerate the convergence rate of the networking equations, reduce the number of iterations, thus to cut down the amount of calculating time.

本文首先建立了适合于暂态稳定分析的简单模型，其中发电机采用E_q恒定模型，考虑了发电机的暂态凸极效应，负荷采用恒定阻抗模型；研究了电力系统的暂态稳定分析方法，指出目前数值积分暂态稳定计算方法中存在的不足，主要是网络方程的求解速度过慢；分析了暂态稳定计算中网络方程的特点，将稀疏技术应用于网络方程的求解，提出了一种新的节点编号方法——最小度最小有源节点道路集算法，减少了网络方程的计算量；在进行交替迭代求解时，将预测算法应用于每一积分步网络方程功角和电压的初值估计当中，应用自回归算法和广义延拓算法，期望给出一个更有效的电压和功角初值方案，来加快方程的收敛过程，减少方程迭代的次数，以提高计算速度。

In SART（Simultaneous Algebraic Reconstruction Technique）,there is no restrict to image space,so the image space's noise will increase after the definite number of iteration.

联合代数迭代方法对重建图像空间是无约束的，其迭代到一定次数后，图像空间的噪声会不断增加。

By reformulating each pass in the original algorithm into two sub-passes, we make the new algorithm suitable to be implemented on GPU. Additionally, we reduce the number of the conditional branch instructions involved in the improved algorithm, taking advantage that there are a large number of similar conditional branch instructions between two sub-passes.

我们对原算法进行细化，将每一次迭代分为两次子迭代，以满足GPU中并行处理的要求，并进一步在子迭代中减少条件判断的次数。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。