迭代的

In order to investigate the performance of Iterative Detection in Golden Code system and reduce the complexity of the Iterative Detection algorithm, the Gaussian Approximation and Minimum Mean Square Error methods are proposed to obtain the soft information of each bit.

为研究级联信道编码的Golden码的迭代检测性能及降低迭代检测算法的复杂度，提出采用高斯近似和最小均方误差算法来计算迭代检测过程中所需的比特软信息。

This new method not only reduces the compute, but also needs not apriority information of the targets compared with Wishart classifier.

该迭代方法与基于Wishart距离的迭代分类方法相比，不需要矩阵的求逆运算和矩阵的对数运算，降低了迭代过程的计算量，也不再需要目标的先验信息，扩展了其适用范围。

Aimed at the calculation complexity of Newton iterative method for solving nonlinear equation,a new iterative method with higher convergence rate and without derivative calculation is presented in this paper.Its convergence rate p is 1.839 and it doesn't need to calculate derivative.

为解决Newton迭代法求非线性方程数值解时必须提供一阶导数值的问题，提出了一个新的迭代方法，该方法不需提供导数值而只需计算函数值，且具有p=1.839的收敛阶，因而是一个收敛速度快且不需要计算导数值的迭代方法。

This paper investigates alternating iterative method and generalized alternating method for the solution of a large linear system, extend the convergence theorem and comparison theorem for generalized or alternating iterative method when the coefficient are Hermitian positive definite systems.

本文主要研究了大型线性方程组的交替迭代法及迭代法的各种变形，给出了当系数矩阵为Hermitian正定矩阵时各类迭代法的收敛原理及其相应的比较理论。

Give out the distinguish theorem of multiple root based on maximum value.

根据导函数的极值分析实根的分布情况、迭代区间和迭代初值，利用三次收敛的迭代方法求解方程的实根，给出了根据极值的重根判别定理。

The paper proposes a method which uses iteration learning control theory to design correction signal to self servo-writing loop. And the correction process can be used to conditions which precision model of plant can\'t be got. The convergence of iteration process can be proved by theory and experiments.

研究发现，自伺服刻写径向误差消除的过程很类似于迭代控制过程，提出用迭代学习控制算法设计自伺服刻写环路的校正信号，并从理论上证明该校正过程能够很好适应无法获取精确致动器模型的情况，证明了迭代过程的收敛性，实验证明径向误差得到较好抑制。

In this paper,first,a formula of the esˉtimation of functional iteration is discussed and a resultwhich is better than old one is obtained.Then a question of iterationlimit of functional serieses and uniform convergence is discussed.

首先讨论了函数迭代估计的一个关系式，得到了函数迭代估计的一个更好的结果；然后研究了函数序列在一致收敛下的一个迭代极限问题。

The relationships between the eigenvalues of Jacobi iteration matrix and the block AOR iteration matrix make a very important role in our analysis. Then we prove some sufficient conditions for the semiconvergence of the block AOR method.

利用块AOR迭代矩阵和相应的块Jacobi迭代矩阵的特征值之间所存在的关系，我们证明了求解奇异p-循环线性方程组的块AOR迭代法半收敛的一些充分件。

Many questions in natural science and engineering canbe transformed into nonlinear equations to be salved,Newton iterative method is an important technique to one-and multi-dimensional variables and iterative process exhibits sensitive dependence on initial guess point.

自然科学与工程中的许多问题都可以转化为非线性方程组的求解问题，牛顿迭代法是重要的一维及多维的迭代技术，其迭代本身对初始点非常敏感。

The algorithm is implemented by a three-stage iterative process. At the first stage, an iterative block matching algorithm is applied to generate more accurate initial disparity vectors, and at the second stage, an iterative polygon matching algorithm is employed to optimize the initial disparity vectors obtained at the first stage to minimize the error of certain triangulations. Finally at the third stage, the unreliable nodes are deleted.

该方法是一个三步迭代过程：首先利用迭代块匹配算法得到较精确的匹配结果；然后利用迭代多边形匹配算法对得到的匹配结果进行优化，使得一些三角形的预测误差最小；最后删除掉视差不可靠的节点。

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.

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