迭代次数

AitkenExtrapolation算法使用Aitken变换以减少迭代次数，但Aitken变换在多数情况下无法确保算法收敛。

Aitken Extrapolation algorithm use Aitken transform to reduce iterations .

对传统的乘法更新NMF迭代次数多，收敛时间慢等缺点，提出将投影梯度应用到NMF，在保证查全率查准率情况下，收敛速度大大的提高了。

Traditional multiplicative update NMF approach has so many iterations and slow convergence time , so we proposed projected gradient approach to the NMF , in the assurance of precision ratio and recall ratio , it can greatly improve the speed of the retrieval .

在分配比特时，降低了原Greedy算法的循环迭代次数。

The circulation iteration times of original Greedy algorithm are reduced .

迭代次数越高，excel重新计算工作表所需的时间越长。

The higher the number of iterations , the more time excel will need to recalculate a worksheet .

初步实验结果表明，该划分方法使得CascadeSVM迭代次数更少，收敛速度更快。

The principial result shows that the Cascade SVM with this new method has less iterative times and faster convergent speed .

在相同雷诺数和精度要求下，W循环所需的外迭代次数较V循环少。

Secondly , the W-cycle multigrid method takes less steps of iterative procedure than the V-cycle version for the same Reynolds and accuracy request .

介绍了一种Q矩阵理论，并将其用于确定本文提出的自适应各向异性扩散方程的迭代次数。

Introduced a Q matrix theory , and use it to determine the iteration number of the proposed adaptive anisotropic diffusion equation . 3 .

仿真结果表明：改进后的粒子群算法迭代次数少，收敛速度比改进的BP算法快，可以对变压器的故障类型进行区分。

Simulation results show that the iterations are fewer , convergence rate is faster than the improved BP algorithm , and the transformer fault types can be distinguished .

在T-S模糊模型的建模中，目前常用的模糊C均值聚类算法存在迭代次数多，计算耗时的缺点。

For T-S fuzzy model 's system modeling , the fuzzy C-means clustering algorithm commonly used has the shortages of more iterative times and calculative time .

脉冲耦合神经网络（PulseCoupledNeuralNetwork，PCNN）可有效的用于图像分割，但无法确定最优分割时的迭代次数。

Pulse coupled neural network ( PCNN ) can be implemented on image segmentation effectively . However , the cyclic iterative times of optimal segementation can not be determined .

OSEM子集及迭代次数对PET图像质量的影响

The Effects of the Subsets and Iterative Times in Reconstruction of OSEM on PET Image Quality

解决了经典的K均值聚类算法对初始聚类中心依赖和迭代次数过多的问题。

An improved k-means clustering algorithm is proposed to solve the limitation of the classical k-means clustering algorithm : over-reliance on the initial cluster centers and the excessive number of iterations .

这种算法减少了FCM的迭代次数，可以使模糊聚类的速度得到很大程度的提高，从而实现墙地砖彩色图像的快速分割。

Experiments show that the improved algorithm can reduce the number of iterations of FCM and greatly enhance the speed of segmentation .

假设（J0-φ0）为泵且处于薄随机层，给出扩散率的解析表达式。同时，我们又数值计算了作为耦合常数b、非线性参数K及迭代次数N等函数的扩散率。

We present estimates diffusion coefficient as a function of coupling constant b , the nonlinearity parameters k and the number of iteration N , and compared with the results of the theoretical .

仿真结果表明，随着Polar码的译码迭代次数的增加，码长的增加或者码率的减小系统的性能也相对变好。

The simulation results show that the Polar-COFDM system performance is better with the increase of decoding iterations times , code length , and the decrease of bit rate .

该算法既具有批处理BP算法收敛时迭代次数少的优点，又能克服批处理算法对大样本集进行学习时每次计算量较大且收敛时间长的缺点。

It not only has the advantage of fewer iteration times like the batch learning algorithm , but also overcomes the disadvantages of much computational work and long learning time while learning big samples .

在本文所提出的纠错系统的基础上，通过增加解码迭代次数，可以根据要求提高纠错能力，这使纠错系统的升级成为可能，再次体现了Top-Down和模块化设计方法的优越之处。

The FEC system can increase the error-correcting ability if we increase the iterative times , which express the excellence of Top-Down designing and blocking .

对不同的迭代次数及缺口深度的Minkowski分形微带贴片天线进行了仿真，并取其中一组天线进行了实验测量。

The Minkowski fractal microstrip patch antennas which have different indentation width and the number of iteration are simulated .

结果表明，该方法减少了迭代次数，加快了运算速度，并且可以产生任意长度的扩频序列，地址数远远大于现有的Gold码。

Experiment results show that the iterative times are reduced , the calculating speed is improved , the spread-spectrum sequences can be reshaped with any length and the number of these sequences is larger than Gold sequence in being .

采用MDO方法，可提高固体火箭助推器的设计质量，大大减少设计迭代次数，从而缩短设计周期。

MDO method can improve design quality for solid rocket booster , and greatly reduce iterative times and shorten design period .

相同迭代次数下，Log-MAP算法比SOVA算法误码率性能好；

Under the same iterative numbers , the error rate of Log-MAP is better than SOVA .

根据设计的仿真程序比较Turbo码在不同约束长度、不同迭代次数以及不同编码速率情况下的性能。

According to the designed emluator , performances of Turbo code are compared under different situations , such as different constrained length , different times of iteration and different encoding speed .

并提出根据最小模糊度准则，自动确定PCNN循环迭代次数和最佳阈值。

Least fuzziness is used to determine the cyclic iterative times and the best segmentation threshold .

对比分析两种算法，Pareto多目标优化算法迭代次数更多，程序运行所需要的时间更长，但结果更优化。

Compared with the two algorithms , Pareto multi-objective optimization algorithm for more iteration , the program needs to run longer , but the result is more optimized .

对于第二个子问题，我们利用一般化的bender分解方法求解，该算法具有更少的迭代次数。

For the second sub-problem , the generalized bender decomposition method is used , and this algorithm has less number of iterations .

该算法利用K均值聚类结果指导模糊聚类的初始化，使模糊聚类的迭代次数明显减少，从而极大地提高模糊聚类的速度。

The algorithm uses the result of K means clustering to guide the initiation of fuzzy clustering so that the iteration number of fuzzy clustering can be reduced obviously , thus the speed of fuzzy clustering can be accelerated greatly .

实测数据处理结果表明，在达到PGA处理效果的同时，该方法有效地减少了迭代次数。

The processing results of real data show that this method reduces effectively iterative degree and gets visual effect that is analogous to that processed by PGA .

分析了不同译码算法、迭代次数以及数据帧长等参数对Turbo均衡系统性能的影响并得出有利于系统参数选择的结论。

After that , the effect to Turbo equalization system , caused by several parameters such as different decoding algorithms , number of iteration , data frame , is analyzed and conclusions are made .

实验结果表明SA达到收敛所需迭代次数及方案分析次数远较GA为多，但其优化结果要好于GA。

The experimental results show that both the iteration number and the scheme analysis number required by SA are much greater than GA , while the optimal result of SA is better than that of GA.

实验表明，该方法重构效果优于采用固定迭代次数的ROMP算法。

The experimental results show that the method can get better reconstruction performance than the ROMP algorithm with deterministic iterative number .