迭代过程

The fast Fourier transform technology is adopted to calculate the dyadic Green's operator and its adjoint operator during each iteration of CSI, which ensures the high efficiency of the algorithm in stratified medium.

CSI的每一次迭代过程均采用快速Fourier变换技术计算并矢Green函数算子及其共扼算子，确保了该算法在三维层状介质情况下的高效率。

In Chapter 1, two solutions to the elliptical boundary value problem have been constructed through a monotone iterative process, and they might be identical. In Chapter 2, the author expresses the local solution to the parabolic initial boundary value problem taking advantage of Green function. In Chapter 3, the asymptotic solution to the initial value problem of Duffing equation is obtained and the method for finding the approximate solution to the inverse problem is put forward.This paper is planned with a view to the author's research means.

从研究结果看：第一章通过单调迭代过程构造出椭圆型方程的边值问题的两个解，并且指出二者可能是同一个解；第二章利用格林函数给出了抛物型方程的初边值问题的局部解的解析表达式；第三章中，先对Duffing方程的初值问题写出解的渐近展开式，再对其反问题提出一种求近似解的方法。

These curves contain a shape parameter which can adjust the softness of curve and have the same continuity with the original B-spline. In succession, using the positive conditions of Bernstein polynomial to find a range in which the shape parameter takes its value so as to make the corresponding interpolating curves monotonicity-preserving and C~2 continuous.

利用奇异混合的思想构造出一类带有形状参数的多项式样条曲线，即均匀α-B样条曲线，在无需反求方程组、迭代过程和最值求解的情况下就能轻松做到插值给定的点列；它含有形状参数α，这就增加了曲线的柔性，同时又和原B样条曲线具有相同的参数连续性。

According to the non-linear characteristic of the transmission line, this paper used the convergence factor to adjust the course of iteration.

根据导线结构的非线性特点，采用了收敛因子来调整迭代过程。

Meanwhile the biconjugate gradient method instead of the conjugate gradient method is used to accelerate the iteration process.

同时用双共轭梯度法代替共轭梯度法来加速迭代过程。

The method is simple, credible and has high precision and rapid calculation convergency.

该方法迭代过程简单可靠、计算速度快、识别精度高，适用于任意形状和边界条件的复杂智能结构。

In this paper, we give a new class of adaptive nonmonotone spectral projected gradient technique for convex constrained optimization.

该文给出了求解凸约束优化的一类新的自适应非单调谱投影梯度法，主要思想是通过引入具有自适应性的权重参数，使算法在迭代过程中能自动调节非单调策略。

Aiming at the multiple loop structures in quality management process network, an improved graph pattern mining approach based on Apriori algorithm is put forward, where a frequent pattern of size k, denoted as G, is joined with another frequent pattern of size k, denoted as G, to form a candidate frequent pattern of size (k+1), if there exists a source vertex s in G and a sink vertex e in G such that the graph derived from G by subtracting node s equals with the graph derived from G G by subtracting node e.

采用基于APriori方法的频繁活动序列挖掘算法，认为k-频繁图集中，当一个图减去其中的一个源顶点后，如果所得到的图与另一个图减去其中的一个沉顶点后的图相同时，可以连接生成一个(k+1)-候选频繁图，从而减少了传统Apriori算法迭代过程中生成的冗余候选频繁图的数目。

The proposed method intro duces an efficient partial orthogonalization method, pairwise Gram-Schmidt orthogonalization, to mitigate this unsatisfied effect.

该方法在每次迭代过程中引入对偶Gram-Schmidt正交化来降低累积误差，从而保证算法具有更好的稳定性。

And during the inversion, two constrained models, flattest and smoothest model, were incorporated into the sensitivity matrix calculated by theoretical formula.

在反演过程中，根据理论公式计算迭代过程中灵敏度矩阵，并采用平坦模型和光滑模型两种约束。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失