查询词典 iterative method

Use of the best domain value method, iterative cycle operation to achieve tthe purpose of image segmentation.

利用最佳域值法，迭代循环运算达到图像分割的目的。

The eigenmode of the structure is solved using subspace iterative parallel method.

采用子结构模态综合算法，结构特征模态采用子空间迭代方法并行求解。

In this paper,by means of the iterative analysis method,the existence for periodic solution of first-order differential equations is considered.

利用迭代分析方法讨论了一类一阶微分方程周期解的存在性，并得到一些新的结果。

The forward-backward methodology is combined with the fast multipole method and the iterative physical optics to improve convergence and computational efficiency.

详细推导了快速多极子方法结合迭代物理光学法和阻抗边界条件的混合计算公式。

The vertex within control mesh of fitting subdivision surface was located by iterative modification and local adaptive subdivision. This method makes it feasible to avoid the solution of linear equation system. The size of control mesh, which is corresponding to the fitting Loop subdivision surface, is smaller. The surface is reconstructed according to the given precision. It can represent detail characteristics of original model, and is piecewise smooth (C^2 continuous everywhere except at extraordinary vertices where they are C^1 continuous).

系统通过对控制网格顶点的循环修正和局部自适应细分来求解最终拟合细分曲面控制网格，避免了求解线性方程组，提高了拟合曲面的质量，实现了在给定精度下用较少的控制网格反映物体细节特征的分片光滑（片内除奇异点C^1，外其余C^2连续）的Loop细分曲面重建。

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 的稀疏性，优化每次迭代的计算量并且减少空间存储量。

In each iterative design, a high efficiency reanalysis method was used to reduce computational effort.

在迭代设计过程中，应用一种高效的重分析方法提高了计算速度。

Chapter 4 gives an iterative maximum entropy rcgularization reconstruction method using the generalized Shannon entropy as the regularizer.

第四章中论述了使用广义Shannon熵作为正则化函数的迭代最大熵重建方法。

For the sake of the image reconstruction efficiency we shortened the reconstruction time almost 100 times by parameter table method. In algebra iterative algorithm we found the range of relaxation parameter is very different. The range of relaxation parameter of ART was narrower than that of SIRT. Different methods of data access will influence on the quality of reconstruction image.

在代数迭代算法中，通过模拟图像的重建发现，ART算法和SIRT算法松弛因子的选择有很大的不同，SIRT的松弛因子选择范围偏小，而ART的松弛因子选择范围要宽得多；数据访问方式的不同，对重建的图像有一定的影响；提出了最优迭代次数的判据，避免了在迭代时迭代次数选取的盲目性。

In this paper, we have deduced an iterative algorithm with relaxation parameter from the successive over relaxation method, which not only deduce the necessary of computation time and memory space but also is propitious to overcome the sensitivity of reconstructed images to incomplete noisy data.

从解大型线性方程组出发，由逐次超松弛法(Successive Over Relaxation， SOR)推导出一种带有松弛因子的迭代法。与 SOR 法相比，该算法不仅大大降低了对计算时间和内存空间的需要，而且有利于克服重建图像对不完全噪声数据的敏感性。

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.

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