迭

Through the application to practices, it indicates that demarcation iterative algorithm has a simple principle and can be proved to be absolutely convergent and independent of the modifying method of iteration variables.

应用实例表明，提出的定界迭代算法原理简单，可保证迭代算法绝对收敛，且与迭代变量的修正方法无关。

On the basis of the conversion relation of inverse matrix and adjoint matrix, by using 1/ω instead of |B'(xBx(subscript k|, a new Landweber iteration formula x(superscript δ subscript k+1)=x(superscript δ subscript k)-ωB'(x(superscript δ subscript k)Bx(superscript δ subscript kB'x(superscript δ kf(x(superscript δ subscript k)-y(superscript δ)is constructed for solving rank deficiency nonlinear least squares problem, with which the phenomenon that leads to ill-posed problem because the iteration matrix is rank-deficient and very ill-conditioned in numerical iterative process is avoided.

基于逆矩阵和矩阵伴随算子的换算关系，并用1/ω代替|B′(xBx(下标k|，构造出一个新的求解秩亏非线性最小二乘问题的Landweber迭代格式，x(上标δ下标 k+1)=x-ωB'(xBx(上标δ下标 k*B'x(上标δ下标 kf(x-y，从而避免了在迭代过程中由于迭代矩阵的秩亏和病态而产生的不适定现象。

The quantum amplitude amplification is the generalization of quantum Grover search algorithm. In this strategy, the Grover iteration has been replaced by two different quantum amplitude amplification operations. This makes it possible to collapse the system with probability 1, in other words, with certainty. The measurement operation in this scheme is only used to cancel the phase factor. Finally, one can use the admissible control to drive the system from the eigenstate to the target state and the control task is accomplished.

量子幅值放大是Grover迭代思想的一般化，该控制方案中采用两种不同的量子幅值放大操作替换了Grover迭代，使得期望本征态的概率幅的模在经过一定次数的迭代之后精确的等于1，然后借助于测量来消除相位因子，使系统的波函数确定性的塌缩到期望的本征态，最后再借助幺正演化，将系统从本征态控制到目标态，实现期望的控制任务。

In Chapter 2, we will use one-parameter subgroups of the Lie group to develop a version ofNewton\'s method on an arbitrary Lie group for maps from a Lie group to its correspondingLie algebra which is independent of affine connections on the Lie group and differs fromNewton\'s method for sections on Riemannian manifolds.

在第2章中，我们主要研究关于从李群到其李代数的映射f的Newton法的收敛性。利用李群的单参数子群来给出关于映射f的Newton迭代点列，此Newton迭代与李群上的联络无关，也与第1章中研究的Newton迭代不同。

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距离的迭代分类方法相比，不需要矩阵的求逆运算和矩阵的对数运算，降低了迭代过程的计算量，也不再需要目标的先验信息，扩展了其适用范围。

In each case, we perform the Metropolis–Hasting's algorithm see

在每种情况下，我们完成了Metropolis-Hasting的算法参见[12、13]的使用服从对数正态分布的提案的参数来模拟随机变量序列的迭代离开10第1000迭代，然后选择一个采样点在每100个迭代来减少迭代关系样品。

This module is not only suit for decoding a concatenated code with non RSCs as its constituent codes, but also it can provide soft information output of both codeword and information bits, so it can be applied to decoding a Turbo code and joint detection and decoding. Taking into consideration serial and parallel concatenated Turbo code, the author proposes a combined code, with 2 outer codes and 2 inner cods as its constituent codes, i.e., 2×2 Woven code.

本文的第三章研究编码技术，在前人研究成果的基础上，为了模块化地对此级联码进行迭代译码，提出了一种模块化的软输入软输出四端口处理模块，此模块可用来处理非RSC卷积码为子码的级联码，并且可以提供码字和信息比特的软信息输出，是一种模块化很强的处理模块，可用于传统的Turbo码的迭代译码，尤其在迭代均衡和迭代检测的系统中并把它运用到B3G的系统设计中。

In chapter three, the author studies channel coding and decoding techniques, that is Woven codes. On the basis of other researchers'results, the author presents a four-port soft input and soft output module, in order to facilitate iterative decoding process of concatenated codes. This module is not only suit for decoding a concatenated code with non RSCs as its constituent codes, but also it can provide soft information output of both codeword and information bits, so it can be applied to decoding a Turbo code and joint detection and decoding. Taking into consideration serial and parallel concatenated Turbo code, the author proposes a combined code, with 2 outer codes and 2 inner cods as its constituent codes, i.e., 2×2 Woven code.

本文的第三章研究编码技术，在前人研究成果的基础上，为了模块化地对此级联码进行迭代译码，提出了一种模块化的软输入软输出四端口处理模块，此模块可用来处理非RSC卷积码为子码的级联码，并且可以提供码字和信息比特的软信息输出，是一种模块化很强的处理模块，可用于传统的Turbo码的迭代译码，尤其在迭代均衡和迭代检测的系统中并把它运用到B3G的系统设计中。

When the coefficient matrice is index p cycle matrice (p = 3,4,5),we educe the relation between preconditionging Jacobi 、 GS iterative matrices" and classical Jacobi iterative matrices" eigenvalue; As an application, make some preconditioning iterative factors, when classical Jacobi iterative converge, the preconditioning iterative methods may converge faster.

2系数矩阵是指数p=3，4，5循环矩阵时，分别给出了预条件Jacobi、Gauss-Seidel迭代矩阵与传统块Jacobi迭代矩阵二者特征值之间的关系，作为一个应用，通过预条件因子的特殊取值，使传统Jacobi迭代收敛时，预条件块迭代法的收敛速度成倍提高。

And Pharaoh spoke to Joseph, saying, Your father and your brothers have come to you.

47：5 法老对约瑟说，你父亲和你弟兄们到你这里来了。

Additionally, the approximate flattening of surface strip using lines linking midpoints on perpendicular lines between geodesic curves and the unconditional extreme value method are discussed.

提出了用测地线方程、曲面上两点间短程线来计算膜结构曲面测地线的方法，同时，采用测地线间垂线的中点连线和用无约束极值法进行空间条状曲面近似展开的分析。