查询词典 iteration method

Direct method of Gaussian elimination, Gaussian main-element elimination, and the iterative method of Jacobi iteration, Gauss - Seidel (Gauss - Seidel) iterative method is linear equations numerical solution of important ways.

直接法中的高斯消去法、高斯列主元消去法，以及迭代法中的雅可比迭代法、高斯-赛德尔（Gauss-Seidel）迭代法又是线性方程组数值求解的重要方法。

These strategies include: an improved adaptive movement penalty method which prevent ill condition matrix based numerical instability, a network topology based identification method which prevent too much tuning and a limited times skipping method of trial iteration.

在上篇中，本文给出了以下内容：第二章详细描述了最优潮流牛顿算法的实现，着重分析了牛顿法实际应用中存在着的两个主要问题：数值不稳定性和如何快速正确地识别起作用的不等式约束集，并提出了相应的处理对策。

Based on the isoperimetric graph partitioning method, we propose several practical segmentation algorithms. The first is the iterative two-way cut method which can segment an image into pieces with particular characteristics each other by iteration. The second is simultaneous K-way cut method which divides the image into K parts synchronously. The last is an interactive method separating objects of interest from the background by the user's input specifying the object of interest manually.

基于等周分割方法，我们提出了几种实用的分割算法：第一种是迭代2分方法，它通过迭代的方法将图像分割成各具特征的小区域；第二种是同时直接K分法，同时将图像分割成K个部分；最后一种方法是交互分割法，它依赖人工输入来指定所要分割的感兴趣目标，将图像目标从背景中分离出来。

Parameters simplification of dynamic relaxation method is an improvement of the traditional method, and the increment of iteration is so small that this promoted method is worthy of further studying.

参数简化的动力松弛法是对传统动力松弛法的改进，而计算迭代次数比原来提高不多，因此，本方法值得尝试与进一步研究改进。

In order to speed up the convergence speed, the each one step of the Landwber iteration is discomposed into the matrix computation and solution and a quick iteration scheme is given for the matrix computation. The relevant accelerated algorithm is given too. Numerical example proves that the accelerated algorithm can quicken convergence speed, reduce the calculation burden, and overcome the obstacle of application of Landweber method of iterated regularization.

为了加快Landweber迭代收敛速度，将每一步Landweber迭代分解为矩阵计算和求解，对矩阵计算部分设计了一种快速迭代格式，并给出了相应的加速算法，通过数值实验验证了这种算法能够大大加快收敛速度，有效的减少计算量，解决了Landweber迭代正则化方法在实际应用中的障碍。

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 thesis, the methods for solving eigenvalue problems and conventional reanalysis methods are studied firstly. Then, a new reanalysis method for real modal reanalysis of structures subjected to topological modification with added degrees of freedom is presented. This method is composed of the single step perturbation method and the Rayleigh-quotient iteration. The numerical examples show that this reanalysis method is very effective and high-quality.

本文首先在对常规的特征值数值求解方法和重分析方法研究的基础上，针对实模态的自由度增加的结构拓扑修改重分析，提出了一种新方法，该方法由于结合了单步摄动法和瑞利商逆迭代法两者的优点，应当是一种比较理想的重分析方法，算例的数值结果也有力的验证了该方法确实是一种高精度、十分有效的实模态重分析方法。

By introducing the nonlinear complementarity problem function, the Karush-Kuhn-Tucker conditions of OPF model are transformed equivalently into a set of semismooth nonlinear algebraic equations. Then the set of semismooth equations can be solved by a semismooth L-M method based on the subdifferential. The method belongs to Newton-type method. It can ensure the positive defmitiveness of the iterative coefficient matrix by using the L-M parameter, which avoids the ill-conditioning of iterative equations. The method, requiring only the approximate solution of a linear system at each iteration, is quite applicable to the large-scale cases.

在利用非线性互补函数将OPF模型的KKT条件转化为半光滑非线性代数方程组后，采用基于次微分的半光滑L-M法求解，该方法属于牛顿法范畴，可通过对L-M参数的调整保证迭代系数矩阵的正定性，克服了系数矩阵的奇异引起的"病态"，且该方法在确定搜索方向时只需求解线性系统的加热器近似解，适用于大规模系统的求解。

The relationships between the eigenvalues of Jacobi iteration matrix and the block AOR iteration matrix make a very important role in our analysis. Then we prove some sufficient conditions for the semiconvergence of the block AOR method.

利用块AOR迭代矩阵和相应的块Jacobi迭代矩阵的特征值之间所存在的关系，我们证明了求解奇异p-循环线性方程组的块AOR迭代法半收敛的一些充分件。

This method prohibits iteration disconvergence by improper selection of original data. The iteration process guarantees that the congestion condition of the network will not change. And the solved Nash equilibrium has real sense.

该方法可以在一定程度上避免由于初始值选择不当导致的迭代不收敛，而且迭代过程可以保证网络阻塞状况不发生变化，有利于得到符合现实意义的Nash均衡。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。