迭代次数

In design of floating-point division, we can use functional iteration arithmetic or very high radix division arithmetic. In the beginning, we use a look-up table to obtain an accurate initial reciprocal approximation, and reduce the time of delay.

在浮点除法器的设计中，若用函数迭代或高基数算法进行除法运算，计算开始时，通过浮点倒数查找表获得一个较精确的初始除数倒数近似值，可以减少除法的迭代次数，缩短运算的延迟。

The numerical results also indicate that the weighted geometric mean method needs less number of iteration than the weighted arithmetic mean method.

数值结果也显示：加权几何平均法所需的迭代次数比加权算术平均法所需迭代次数少。

It usually has a so-called superlinear convergence behavior. The rate of convergence seems to improve as the iteration proceeds. For another say, the rate of residual variable will be improved as we increase its iteration.

GMRES算法在迭代过程中通常表现出一种加速收敛行为，随着迭代次数的增加，这种加速收敛现象越明显，即残量收敛会随着迭代步数的增加而逐渐得到改善。

If the iterative step is greater than a certain number, the fictitious equilibrium force will change simply with factor of slope.The algebraic method is efficient to obtain a convergence value of safety factor.

研究结果表明：基于给出的算法，通过迭代求解安全系数，收敛速度快；在迭代初期，平衡力与安全系数间有较复杂的对应关系；当迭代次数大于某一值后，平衡力随安全系数的增加而单调地变化。

It was found that there's definite product relationship between the iteration times m and the corresponding critical equivalent coefficient error.

特别地，对带有迭代若干次的充分伸展的Marcov映射的混沌加密系统，其迭代次数m与相应的临界等效系数误差间存在明确的倍数关系。

Simulation results show that ordinal check with degressive iterative number is optimal, which can effectively decrease the complexity and acquisition time.

仿真结果表明顺次迭代且迭代次数递减的校验方法最优，该方法能够在不损失检测概率的情况下降低Gold码捕获的复杂度，同时降低其捕获时间。

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的松弛因子选择范围要宽得多；数据访问方式的不同，对重建的图像有一定的影响；提出了最优迭代次数的判据，避免了在迭代时迭代次数选取的盲目性。

Richardson iterative method is adopted to restore the image degraded by thick pinhole. The stopping rule of the iteration is determined by the simulation results.

针对厚针孔成像过程的空间移变性，采用Richardson迭代法进行图像复原处理，取得了满意的复原效果，并提出迭代次数的确定方法。

The overlapping domain decomposition method and nonoverlapping domain decomposition method is introduced for the Laplace problems.

介绍了求解Laplace方程的重叠和不重叠区域分解法，研究了重叠域大小与迭代收敛性的关系，比较了重叠和不重叠区域分解法的迭代次数。

this paper analyses the basic principle of tpc,compares the error performance in the system which has been applied with tpc with the uncoded system,studies the influences which different block codes and iterative numbers to tpc decode performance.under the circumstances of different iteration numbers and block codes,experiment simulation is carried on.the simulation results indicate that introduction of tpc can get the code gain of 5~6 db.tpc decoding algorithm is simple,and doesn′t have the error floor,the complexity of its hardware implementation is smaller,it is a kind of practical channel coding method.

摘 要：在分析turbo 乘积码的基本编译码原理的基础上，比较了未编码与编码后系统的差错性能，研究了选取不同分量码、不同迭代次数对tpc译码性能的影响。在不同迭代次数与分量码情况下，进行了仿真实验。仿真实验表明，在相同的差错性能条件下，采用tpc码能带来5~6 db的编码增益。tpc译码算法简单，没有错误平层，硬件实现复杂度较小，是一种非常实用的信道编码方式。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。