迭代计算

We construct a kind of special matrix function, which is used to characterize the minimization property of this iterative method, and prove that the approximate solution, generated by this iterative method, minimizes this kind of matrix function over a special affine subspace, which means that the Frobenius norm of the residual sequence is strictly monotone decreasing.

通过构造一类特殊的矩阵函数来刻画该迭代方法的极小化性质，并证明了由该迭代方法计算出来的逼近解，可使得这类矩阵函数在一个仿射子空间上达到极小，而且所得到的残差序列的Frobenius范数是严格单调递减的。

Iterative method with numerical integration, error under their control, using Newton iteration method.

详细说明：用迭代法计算数值积分，误差自己控制，用牛顿迭代法实现。

In order to ensure the rapid convergence of the method, incomplete precondition LDLT technology is used.

在预处理技术做保证的条件下，引入Krylov子空间迭代法，计算表明，该迭代方法结合预处理技术后收敛速度非常快，是高效快速求解电磁有限元模拟中形成的大型复系数方程组的最佳选择。

This enables us to get rid of ratio test in pivoting, reducing computational cost per iteration to a large extent.

这样摆脱了迭代时的比值检验，减少了每次迭代的计算工组量。

So the computing time of this scheme may be similar to that of Ritz method,but quite less than that of subspace iteration method.

因此，整个计算工作量比子空问迭代法少得多，但由少是从一个初始向量开始迭代，：针兰算时，主要业计算机的舍入误差求衬重特征解。

The Newton-Raphson iteration technique is employed to solve the displacement nonlinear equations of the structure.

在迭代过程中，为了提高计算效率可采用简单迭代法由节点位移求解单元应力场。

In each step the tangent plane of limit state surface at the previous iterative point is calculated firstly, and then a line from origin to a point on the plane is determined whose intersection with limit state surface satisfies the requirement of feasible direction and convergence.

算法在每步迭代中先计算极限状态曲面在前步迭代点处的切平面，然后在此切平面上选定一个点，使该点和原点的连线与极限状态曲面的交点满足可行方向和收敛的要求。

That the generation of smaller candidate sets enables us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly.

要注意，生成较小的候选集可以使我们在迭代的早期有效地削减事务数据库的大小，从而大大地减少了以后的迭代的计算量。

The paper describes a new iterative decoding algorithm for the product codes, its feedback method is completed by a linear combination of soft output of encoder and the receipt information is different with the traditional turbo iterative decode. When decoder obtains the soft output matrix built -1 and +1, the complexity can be reduced greatly and the performance can be lost utile by reducing the number of candidate code words and omitting the complicated operation of LLR.

针对乘积码提出一种新的迭代解码算法，该算法的反馈方式有别於Turbo码的传统迭代译码，是通过输出软信息与接收软信息进行线性叠加来实现的，此时子译码器的候选码字个数将大为降低，同时译码输出也无须做复杂的LLR计算，直接映射为由-1，+1组成的软输出矩阵，从而在牺牲较小性能的情况下很大程度地降低了译码复杂度。

Based on the improved Atiken iterative method and dimidiate method, a new algorithm of searching zero of derivative function is given, the simulation results show that if using the new algorithm to find the zero of derivative function, the convergence speed is faster than the improved Atiken iterative method .

采用二分法预报、改进的Aitken迭代校正的方法，构造了一种求导数零点的一种新算法。新算法在迭代过程中不用计算导数，且二阶收敛。数值试验表明，该算法具有较高的精度和较大的初值选择范

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.

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