迭代的

基本解释 (translations)

iteratively  ·  iterated

与迭代的相关的网络例句 [注：此内容来源于网络，仅供参考]

Actively promote iterative and incremental development. Agile Modeling's practices of Model in Small Increments, Iterate to Another Artifact and Create Models in Parallel can be tough ones for experienced modelers to adopt and chances are that your experienced modelers are already chaffing at the UP's concepts of iterations, let alone an even greater emphasis on iterative and incremental modeling.

积极促进迭代增量开发敏捷建模有个实践，以小增量迭代的方式建模到另一个工件以及积极促进迭代增量开发并行创建模型，它们被有经验的建模人员坚持采用，并成为有经验的建模人员嘲讽 UP 迭代概念的机会，而并不在意那甚至是一个更加强调迭代和增量建模过程。

Iterating : A QuerySet is iterable, and it executes its database query the first time you iterate over it.

迭代 ： QuerySet 是可以迭代的，它会在迭代结束的时候执行数据库查询。

To that of looping over sequence items. In fact, for most cases, you cannot tell

你不可能分辨出你迭代的是一个序列还是迭代器，因此我们可以参考迭代其他对象时的代码

The reconstruction problem is ill-posed, so two optimal criterions, the least module and the smoothness criterion base on Tikhonov regularization technique, are introduced into reconstruction algorithm. Many regularization parameters choice strategies are investigated, and the TPA(Two—Parameter Algorithm) strategy which is based on the Morozov discrepancy principles, is implemented in two regularization reconstruction algorithms.Numerical experiment results show that the nonnegative and smoothness constraint condition can overcome the difficulty of iteration semiconvergent, preconditioned technique can improve convergence rate and reconstruction accuracy, smoothness regularization criterion can meliorate ill-posed problem of reconstruction and enhance iteration stability, and the TPA is an effective strategy of regularization parameters choice.

数值试验表明：在共轭梯度法中引入非负约束和光滑约束改善了迭代的"半收敛"性，非负约束保证了解的非负性，光滑约束抑制了重建解的振荡现象，约束算法的重建精度与无约束算法相比大幅度提高；在约束共轭梯度重建算法中引入预优技术，可以加快算法的收敛速度，提高迭代的稳定性和重建精度；引入光滑准则的正则化技术可以有效改善图像重建问题的不适定性，加快迭代的收敛速度，提高迭代的稳定性和图像重建质量，计算正则参数的TPA算法在闪光照相图像重建中是有效的。

A criterion for divergence of iteration is given and the covergence speed and covergence acceleration for iteration with multiple root are investigated.

给出迭代发散的一个判定，并讨论重根情形下迭代的收敛速度和迭代加速。

We analyze the advantage of the simple iterative method over Newton method at last. The numerical examples show that the more computational time has saved by the simple iterative method than the Newton method.

最后分析了简单迭代和牛顿迭代的优劣对比，数值算例表明在同样精度下简单迭代更节约计算时间。

If the argument is an iterable, i.e., a sequence, an iterator, or an object that supports iteration, then each element of the iterable must come in pairs.

如果参数是可以迭代的，即，序列，迭代子，或是支持迭代的对象，那每个可迭代的元素必须成对出现。

If the argument is an iterable, i.e., a sequence, an iterator, or an object that supports iteration, then each element of the iterable must come in pairs.

如果参数是可以迭代的，即，一个序列，或是一个迭代子，或是一个支持迭代的对象，那每个可迭代的元素必须成对出现。

If the argument is an iterable, i.e., a sequence, an iterator, or an object that supports iteration, then each element of the iterable must come in pairs.

如果参数是可以迭代的，即，一个序列，或是一个迭代器，或是一个支持迭代的对象，那每个可迭代的元素必须成对出现。

The reconstruction problem is ill-posed, so two optimal criterions, the least module and the smoothness criterion base on Tikhonov regularization technique, are introduced into reconstruction algorithm. Many regularization parameters choice strategies are investigated, and the TPA(Two—Parameter Algorithm) strategy which is based on the Morozov discrepancy principles, is implemented in two regularization reconstruction algorithms.Numerical experiment results show that the nonnegative and smoothness constraint condition can overcome the difficulty of iteration semiconvergent, preconditioned technique can improve convergence rate and reconstruction accuracy, smoothness regularization criterion can meliorate ill-posed problem of reconstruction and enhance iteration stability, and the TPA is an effective strategy of regularization parameters choice.

数值试验表明：在共轭梯度法中引入非负约束和光滑约束改善了迭代的&半收敛&性，非负约束保证了解的非负性，光滑约束抑制了重建解的振荡现象，约束算法的重建精度与无约束算法相比大幅度提高；在约束共轭梯度重建算法中引入预优技术，可以加快算法的收敛速度，提高迭代的稳定性和重建精度；引入光滑准则的正则化技术可以有效改善图像重建问题的不适定性，加快迭代的收敛速度，提高迭代的稳定性和图像重建质量，计算正则参数的TPA算法在闪光照相图像重建中是有效的。

与迭代的相关的网络解释 [注：此内容来源于网络，仅供参考]

Iterating：迭代

值聚合,包括组装(populating)条目和从所有条目读取过滤的和未过滤的值解析(rendering)整个表单,通过执行定制解析的单个装饰器(decorator)或者迭代(iterating)表单中的所有条目Zend_Form 是可迭代的(iterable),

iteration：迭代

每一个阶段都由一个或多个连续的迭 代(Iteration)组 成,每一个迭代都是一个完整的开发过 程. 与Core Workflow 不 同,RUP 并没有也无法给 出Iteration Workflows 的具体实现步 骤,它需要项目经理根据当前迭代所处的阶 段、以及上次迭代的结 果,

iterations：迭代

图1所示的是RUP的开发模型,从中可以直观的看到RUP的整体框架组成,包括四个顺序的开发阶段(Phases)、九个核心工作流(Core Workflows)以及迭代(Iterations)式的开发过程.

Maximum iterations：最大迭代步数

"Levenberg-Marquardt"项,采用麦夸尔迭代法),系统缺省设置. 该法要求输入的参数为: | "Maximum iterations"最大迭代步数. | "Sum-of-squares convergence"在一步迭代中目标函数残差平方和的变化比例小于设置的值时...

iterative：迭代的

DSSA的领域工程过程是并发的(concurrent)、递归的(recursive)和迭代的(iterative). 或者可以说,它是螺旋型的(spiral). 完成这个过程可能需要对每个阶段都经历几遍,每次增加更多的细节. 对每个阶段的描述中包括一组需要回答的问题,

Iterative development：迭代开发

186.迭代开发(iterative development) 包括一系列步骤的系统开发,或称为迭代. 每个迭代都比前一个更接近所希望的系统. 每一步的结果必须是可执行的系统,以供执行、测试和调试. 迭代开发符合于递进式开发. 在迭代递进式开发中,

optimality：目标函数的迭代误差限

"Step Iimit"最大步长. | "Optimality"目标函数的迭代误差限. | "Function"函数精度,应比目标函数的迭代误差限小.

Redefining Class Iteration )：重定义类的迭代

数组与对象属性迭代器 ( Array and Object Property Iteration ) | 重定义类的迭代 ( Redefining Class Iteration ) | 迭代器、SPL类、接口 ( Iterator and SPL Classes and Interfaces )

max iter：表示某些迭代方法的最大容许迭代步数

restart 表示某些迭代方法的重启动步数. | max iter 表示某些迭代方法的最大容许迭代步数. | initial residual 表示迭代方法的初始误差.

iterated：迭代的,重复的

negligible 无限小的 | iterated 迭代的,重复的 | unary 一元的