迭代过程

An approximate method is proposed to accelerate the iteration.

提出了一种可加速迭代过程的近似算法，探讨了用较少的迭代步数去逼近精细解。

Unified expression for the iterative of centers is described as to deduce the conditional probability expression of the centers and data weight functions for FKHM. Finally, the partition similitude is used to evaluate the result of clustering.

在中心迭代聚类算法的统一框架的基础上，推导出FKHM算法聚类中心的条件概率表达式以及在迭代过程中的数据点加权函数表达式。

If the Landweber method and pre-iteration method were convergent, the residue sequence would be monotone decreasing. By analyzing the convergence, the fact is demonstrated that for the severe ill-conditioned matrix of sensitivity coefficient, because of the limitation of the precision of the computer, the residue sequence is not monotone decreasing; thereby the reconstruction images diverge from the true distribution of the conductivity. So the generalized inverse method with threshold is established and the selection way of the regularization parameter is presented, by which the better images are reconstructed.

Landweber法和预迭代法收敛，则其残差序列单调递减，通过对它们的收敛性进行分析，证实对于病态性严重的灵敏度系数矩阵，由于受计算精度的限制，迭代过程中的残差序列不再单调递减，从而导致重建图象偏离实际电导率分布，因此作者建立了带阈值的广义逆算法，提出了规则化参数选择方法，获得了较好的图象重建质量。

Regarding iterated processes as objective function,parameters of algebra iterated system as design variables,and boundary condition of iterated variables as constrains,a new optimum method was proposed,which was used to calculate bifurcation of Logistic mapping.

以迭代过程关系构成目标函数，参数为设计变量，迭代变量的边界为约束，建立关于分支值计算的新方法含约束条件的最优化程序算法。

The Hessian matrix of every function in this model is constant, so it will be calculated once in the entire optimal process based on interior point method, which speeds up each iteration.

该新模型的海森矩阵是精确的常系数矩阵，在内点法迭代过程中只需要计算一次，从而缩短了每次迭代的计算时间。

In the program the Newton-Raphson's method is used to iterative computation; and the method of either the cylinder-arc-length or the minimum residual displacement is adopted to control the iterative process.

在分析非线性静力和动力有限元计算方法的基础上，本文采用修正的Newton-Raphson方法进行迭代计算，并采用柱面弧长法和最小残余位移法控制迭代过程，编制了一个适合于杆件体系结构的有限元分析程序，结构可以按桁架、刚架或梁杆组合体系分析。

One is introducing a weighting factor to reduce oscillation of solution of diagnosis equation in each iteration.

因此本文又进一步提出了改善诊断方程收敛性的措施，包括在迭代过程中引入加权因子来修正元件参数的调整量，以及根据诊断方程的解判断元件参数故障偏移的方向和大小对迭代初值进行调整。

This model adapts the prior information of piecewise continuity of image to construct a nonlinear diffusion model,which is used to smooth an enlarged image by nearest interpolation to reduce the blocky effect caused by enlargement,simultaneity,and interpolation condition is added into the iterated process to avoid a too smooth image.

新模型利用图像为分片连续的二维曲面的先验信息，采用非线性扩散方程对基于最近邻方法放大后的图像进行光滑以消除因放大引起的"块状"效应，同时在迭代过程中加入插值条件使处理后的图像能较好的保留边缘，由此构造出基于偏微分方程的图像分辨率增强模型和相应的迭代算法，使图像的分辨率增强到亚像元级。

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

This new algorithm can derive a rheological parameter estimation that shows superior statistic features of fitting residual error unbiasedness and least variance.

该算法不需要人工给定迭代初始值，迭代过程稳定收敛到最小点，不会陷入极小点陷阱，收敛速度很快，所得到的流变参数估计具有拟合残差无偏性和方差最小的优良统计特征。

And Pharaoh spoke to Joseph, saying, Your father and your brothers have come to you.

47：5 法老对约瑟说，你父亲和你弟兄们到你这里来了。

Additionally, the approximate flattening of surface strip using lines linking midpoints on perpendicular lines between geodesic curves and the unconditional extreme value method are discussed.

提出了用测地线方程、曲面上两点间短程线来计算膜结构曲面测地线的方法，同时，采用测地线间垂线的中点连线和用无约束极值法进行空间条状曲面近似展开的分析。