查询词典 iteration method

The method of Newton iteration extended on kristjan to solve the match between the sample points and design model in checking surface is present.

提出基于kristjan法扩展的牛顿迭代算法来解决曲面检测问题中的采样测量点与设计模型的匹配问题。

During the computation, the author generalized the method of mesh movement and iteration scheme in the ALE formulation.

针对问题的特点，本文在比较了多种自由面算法以后，选用ALE有限元方法计算以上问题。

The paper gives a special discussion of regularization method in inverse problem. On this basis, an ideal solution for ill-posed problem is built-the best disturbed iteration.

论述了反问题的高度非线性及求解的不适定性，分析了反问题求解的各种方法，并对在反问题求解过程中经常遇到的一类离散不适定问题进行了详细地分析和研究，并给出了具体的算法。

New iteration way for free surface and discharge is presented on the basis of the characteristics of Monte Carlo method.

根据蒙特卡罗方法可以独立计算区域内任一点值的特点，提出了相应的自由表面和流量的迭代计算方法。

Newton iteration is the most elementary and important method for solving nonlinear equation.

的非线性方程的求解问题。

Newton method ; iteration ; order of convergence

牛顿法；迭代；收敛阶

If the pattern has a low rate of convergence, the time of the human and machines will be wasted and the answer are not surely attainable.So,we must look for the patterns with the high rate of convergence or try to settle some parameters of the iteration patterns (for instance the overrelaxation parameter of SOR iterative method).

本文第二章针对AOR迭代法考察了当线性方程组的系数矩阵A为(1，1)相容次序矩阵且其Jacobi特征值为纯虚数或零时的迭代收敛范围，最优参数(即最优松弛因子和最优加速因子)及与之相应的谱半径，并将此最优谱半径与相应的SOR的进行比较，定量的给出在不同条件下，AOR和SOR迭代法各有其优越性，从而圆满的解决了在这两种迭代法之间如何适当的选择最佳迭代法的问题。

Computer graphics users at Xerox PARC found that, by using this method, they usually get acceptable prints on the first iteration.

而在施乐PARC中心的用户则发现使用这种方法后，他们通常只须一次迭代就能得到可以接受的打印质量。

The embodiment of the invention provides a method for coding the low-density parity checking code, comprising the following steps: in the iteration for the time of k, the variable node corresponding to an overturn function meeting the preset condition is overturned; according to the preset parameter, the reliability of the overturned variable node is corrected; according to the sequence of the overturned variable node, the checkout sub sequence is determined so as to output the coding result.

本发明实施例提供了一种低密度奇偶校验码的译码方法，主要包括：在第k次迭代中，对满足预设条件的翻转函数对应的变量节点进行翻转，根据预设的参数修正被翻转的变量节点的可靠度，根据翻转后的变量节点序列，确定校验子序列，以便输出译码结果。

The original PageRank algorithm uses the Power Method to compute successive iterations that converge to the principal eigenvector of the Markov matrix representing the Web link graph.Authors use the sparse of the Google matrix P in the iterative matrix A =[ CP +（1- c ） E ]T,optimize the computation of each iteration and reduce storage space.

在PageRank算法中是使用乘幂法对网络链接图的Markov矩阵进行迭代计算，利用迭代矩阵 A =[ CP +（1- c ） E ]T中Google矩阵 P 的稀疏性，优化每次迭代的计算量并且减少空间存储量。

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.

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