查询词典 iterative

By introducing the nonlinear complementarity problem function, the Karush-Kuhn-Tucker conditions of OPF model are transformed equivalently into a set of semismooth nonlinear algebraic equations. Then the set of semismooth equations can be solved by a semismooth L-M method based on the subdifferential. The method belongs to Newton-type method. It can ensure the positive defmitiveness of the iterative coefficient matrix by using the L-M parameter, which avoids the ill-conditioning of iterative equations. The method, requiring only the approximate solution of a linear system at each iteration, is quite applicable to the large-scale cases.

在利用非线性互补函数将OPF模型的KKT条件转化为半光滑非线性代数方程组后，采用基于次微分的半光滑L-M法求解，该方法属于牛顿法范畴，可通过对L-M参数的调整保证迭代系数矩阵的正定性，克服了系数矩阵的奇异引起的"病态"，且该方法在确定搜索方向时只需求解线性系统的加热器近似解，适用于大规模系统的求解。

An iterative algorithm based on MRP is used to get the saliency scores of sentences. The evaluation shows that the iterative algorithm converges rapidly. Compared with the traditional summarizing method and MS Word Summarizer, the sentence weighting method based on MRP can improve the summarizing performance.

实验结果表明，基于MRP的迭代算法收敛速度快；与传统的自动文摘方法和MS Word Summarizer相比，所提出的基于MRP的句子加权方法可以使自动文摘系统具有更好的性能。

In SMFSIA/CAG, to increase computational efficiency in solving the matrix equation, both the speed of the iterative convergence and the matrix-vector multiplication are picked up based on iterative theory. The extended formula of the high order Taylor's series about the horizontal distance is derived. The relationship between the Taylor's series or the neighborhood distance and the efficiency of the arithmetic are analyzed.

在SMFSIA/CAG中，基于迭代法的原理，通过加快迭代收敛速度和加速矩阵向量积两个方面对该算法进行了改进，推导了关于平面展开的高阶泰勒级数展开公式，并对近场相关距离和泰勒级数展开阶数对算法效率的影响进行了分析。

when computing the next tracing point, the traditional tracing method generally used the iterative method. but the iterative method had to face the following problems.

摘 要：传统的跟踪方法在求下一个跟踪点时一般是采用迭代法，而迭代法会出现初始值的选取和迭代收敛的问题。

The constructing process of the algorithms itself indicate that they are brevity and have definite geometric meaning, scientific iterative terminal criterions and no strict requirement to function. Finally, some digital experimentation is presented to indicate the algorithms application in solving the problem of maximum of function, transcendental equation,integer programming and so on. The results indicate that the algorithms have more global and more adaptability compared to traditional algorithms and have more calculating efficiency and more scientific iterative terminal criterions compared to some present popular artificial intelligence algorithms.

算法的构造过程本身表明了该算法简单明了、几何意义明确、迭代终止准则科学、对函数的要求较低；最后举了几个数值试验的例子以说明该类算法在求函数的最值，解超越方程以及整数规划等问题中的应用；数值试验的结果标明该算法比单纯由"微分"思想演化而来的传统算法有更好的全局性和对问题的更广泛的适应性，比现在流行的一些人工智能方法有更高的运算效率和更适当的迭代中止准则。

In this paper, the effects to image reconstruction by adopting different ways of sequence's truncation in unrelaxed iterative algorithm is discussed and further studying on the conditions to iterative reconstruction with phase -only have been done.

Sh~n在1949年发表了采样定理，提出在一定条件卜，可以用离散采样值重构带限连续信号。七十年代，l铭an等人提出了几个从零交叉点重构带通或带限信号的定理及其算法。1983年J.L.C.Salu和T.S.Huang对各种关于频谱有限信号外推问题的算法进行分析，提出了统一的迭代算法。

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组成的软输出矩阵，从而在牺牲较小性能的情况下很大程度地降低了译码复杂度。

In section 3, on the base of the iterative algorithm, we obtain a new iterative algorithm which is convergent to the signal faster than the old one. In section four, if the form of φ is simple and the sampling set is the integer set Z, then a direct reconstruction formula is presented.

在第二节，我们通过计算对偶框架来重建信号，这与传统的计算对偶框架方法不一样，该算法是通过计算一个矩阵的逆矩阵来计算对偶框架，当矩阵是奇异矩阵时，可通过奇异值分解方法或截断奇异值分解算法来求矩阵的广义逆矩阵。

In this paper, an iterative algorithm is proposed to find the generalized centrosymmetric solution pair of matrix equation AXA~T+BYB~T=C. The solvability of the matrix equation can be determined automatically in the iterative process. When the matrix equation is consistent, the solution pair can be obtained within finite steps in the absence of round-off errors.

该论文运用迭代方法研究了矩阵方程的一般中心对称解解，特别地，当矩阵方程是相容的时，经过有限步就能求出该方程的一般中心对称解解，然后以此为主要依据进一步研究了矩阵方程的最优近似解，最后举例验证了该论文的主要结论。

When the matrix equation is consistent, its centrosymmetric solution can be obtained within finite iterative steps in the absence of round off errors for any initial centrosymmetric matrix X1, and its least-norm centrosymmetric solution can be derived by choosing a suitable initial iterative matrix.

当矩阵方程AXB+CXD=F有中心对称解时，在有限的误差范围内，对任意初始中心对称矩阵X1，运用迭代算法，经过有限步可得到矩阵方程的中心对称解；选取合适的初始迭代矩阵，还可以迭代出极小范数中心对称解。

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.

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