查询词典 iteration method

The new algorithm which combines matrix method with iteration method is presented.

提出一种新算法———迭代法结合矩阵法求解模型并给出算法框图。

Based on utilizing the unified chaotic model to obtain initial points of Newton iteration method, a new method for solving sets of nonlinear equations is proposed.

以统一混沌模型产生牛顿迭代的初始点，提出了基于统一混沌的牛顿迭代法求解非线性方程组的新方法。

A new calculation method of structure-spring compensation iteration method presented in the paper can solve the problem of space nonlinear interaction of arch-shaped support structure.

本文提出新的具有普遍适用性的结构计算方法~弹簧补偿迭代法。

The penalty function method and modified Newton iteration method are adopted to solve the constrained nonlinear optimization problem.

基于截面特征的反求工程CAD建模方法已成功应用于基于特征的反求工程CAD建模系统RE-SOFT中，结合一个反求工程建模实例论证了该方法的可行性和适用性。

We present an inverse method based on Tikhonov regularization theory. A regularized functional is established and regularization parameters are deduced with Arcangeli criterion and Morozov discrepancy principle. The functional is solved by sensitivity coefficients and Newton-Raphson iteration method.

充分考虑非线性瞬态热传导过程测温数据的误差特点，根据Tikhonov正则化理论，构造合适的正则化泛函，利用Arcangeli准则和Morozov偏差原理确定正则参数，采用灵敏度系数和Newton-Raphson迭代法求解该泛函。

Iterative method with numerical integration, error under their control, using Newton iteration method.

详细说明：用迭代法计算数值积分，误差自己控制，用牛顿迭代法实现。

In this paper,the artificial parameter perturbation method and variational iteration method have been applied to nonlinear differential equation with power nonlinearities.

应用人工参数法和变分迭代算法，求解了具有分数阶非线性的一阶常微分方程。

This approach uses the geometric features and radiation features of the road, according to the small amount seed points given by the user, each point in the road centerline can be gotten. Then an adaptive gray template is used to adjust each point in the road centerline. Finally, least square method and Newton iteration method are adapted to each point in the road centerline to fit a polygonal line.

该方法利用道路地物的几何特征和辐射特征，根据用户提供的少量道路种子点，利用自适应灰度模板对道路中心线上的每个点进行调整，最后采用最小二乘算法和牛顿迭代法对调整后的道路中心线上的每个点进行拟合，以此获得趋近于道路中心线的最佳折线。

In this paper, we study the iteration method approximating zero points of m-accretive operators in reflexive Banach space. The strong convergence of the revised method is proved. These results extend and improve corresponding results of others.

文章在自反Banach空间中研究了m-增生算子的零点迭代逼近问题，证明了修正的迭代算法强收敛到m-增生算子A的一个零点，此结果推广和改进了一些相关结论。

So the computing time of this scheme may be similar to that of Ritz method,but quite less than that of subspace iteration method.

因此，整个计算工作量比子空问迭代法少得多，但由少是从一个初始向量开始迭代，：针兰算时，主要业计算机的舍入误差求衬重特征解。

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.

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