迭代的

Given a skip-parser type SkipT, skip_parser_iteration_policy creates a scanner iteration policy that skips over portions that are recognized by the skip-parser. This may then be used to create a scanner. The scanner_policies class wraps all scanner related policies including the iteration policies.

给与一个类型为 SkipT 的跳读分析器，则 skip_parser_iteration_policy 将创建一个会跳过被跳读分析器所匹配的内容的扫描器迭代策略。scanner_policies 类封装了包括迭代策略在内的所有与扫描器相关的策略。

The systematic analyses and studies, including stability analyses, optimum schemes, optimum choice of coefficient, optimum sequence of values for the acceleration parameter and optimum relaxation parameter, etc.

三、运用模型方程对二维高效AF2迭代算法的格式稳定性，最佳格式系数分列准则以及有关加速参数，松弛因子的选择等问题作了系统的分析和研究；并对三维模型方程的AF2迭代算法格式稳定性问题作了讨论和分析。

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迭代法等)的收敛性与这些矩阵类的关系。

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迭代序列的收敛性及确保迭代程序收敛到不动点的条件，所得结果是单值非扩张映象的推广和发展。

In the solution of the Difichlet boundary problem ofLaplace equations, we provide an effective method for determining the spectral radiusand the best slack variable of block basic iterative methods. At the same time, wepresent the spectral radius and the best slack variable of basic iterative methods from thenine-point difference scheme.

在解决Laplace方程Dirichlet边值问题上，文章为确定块基本迭代方法的谱半径和SOR方法最优松弛因子提供了一个有效的方法，并推导了九点差分格式下的块基本迭代方法的谱半径和SOR方法最优松弛因子。

The implicit iterative method was applied to the linearized Newton equation, and the key step in the process was that a new reasonable a posteriori stopping rule for the inner iteration was presented.

对线性化后的Newton方程用隐式迭代法求解，关键的一步是引入了一种新的更合理的确定迭代步数的后验准则。

Suppose there exist a strictly increasing function Φ: 0,∞→

若存在严格增加函数Φ：[0，∞]→0，∞，Φ(0)=0，jx(下标 n+1-x∈Jx(下标 n+1-x使得〈T(上标 n-1)x(下标 n+1)-T(上标 n-1)x， jx(下标 n+1-x〉≤k‖x(下标 n+1)-x‖^2-Φ‖x(下标 n+1-x‖，n≥1，x是T的不动点，在对参数的一些限制条件下，本文证明了迭代序列｛x｝强收敛于非自映象T的不动点x，其目的是把对渐近伪压缩映象的迭代结果推广到渐近伪压缩非自映象上，从而推广了以前的结果。

So the convergence properties of the subspace trust region methods are as strong as those of its full-space version.

在算法的迭代过程中加入内点法的思想，要求每一步产生的迭代点位于可行域的严格内部。

In each step the tangent plane of limit state surface at the previous iterative point is calculated firstly, and then a line from origin to a point on the plane is determined whose intersection with limit state surface satisfies the requirement of feasible direction and convergence.

算法在每步迭代中先计算极限状态曲面在前步迭代点处的切平面，然后在此切平面上选定一个点，使该点和原点的连线与极限状态曲面的交点满足可行方向和收敛的要求。

According to the three criteria, an appropriate doorsill is found by adaptively adjusting a discount factor in the process of iteratively solving. 2. 3 Method of Processing the Deleted Elements According to the doorsill, the continuous topological variables can be regressed to the 0-1 type discrete topological variables.

2.2 调整折减系数搜索最佳阈值为了能使程序快速准确的得到满足约束的最优拓扑结构，根据框架结构的特性引入结构非奇异、结构响应不被违背和结构重量不改变三个准则判断迭代收敛，并根据这三个准则的满足情况，在优化迭代过程中自适应的调整折减系数来搜索最佳阈值。

According to the clear water experiment, aeration performance of the new equipment is good with high total oxygen transfer coefficient and oxygen utilization ratio.

曝气设备的动力效率在叶轮转速为120rpm～150rpm时取得最大值，此时氧利用率和充氧能力也具有较高值。

The environmental stability of that world - including its crushing pressures and icy darkness - means that some of its most famous inhabitants have survived for eons as evolutionary throwbacks, their bodies undergoing little change.

稳定的海底环境─包括能把人压扁的压力和冰冷的黑暗─意谓海底某些最知名的栖居生物已以演化返祖的样态活了万世，形体几无变化。