数值算法

Numerical experiments show that the updating algorithm by using intergeneration differential and chaotic mutation (algorithm 8) is a good selection. Simultaneously, the updating effect is perfect when the updated particles are about 20%.

通过数值实验得出基于代间差分和混沌变异的粒子更新算法（即算法8）是一种很好的选择，并且当性能较差的20%左右粒子按照这种算法更新时效果较好。

This paper proposed an implicit technique based on the Jacobi's iteration method. The theoretical demonstration and analysis show that the proposed method meet both the real-time and the stability requirement well. The new method which can update stably the state of n mass points with the time complexity of O has great advantages over the existing implicit integration methods.

本文提出了一种基於雅可比迭代法的隐式数值积分算法，通过理论证明和分析，该算法稳定地更新n个质点的状态所需时间复杂度为O，较已有的隐式积分算法有了很大的改进。

Theoretic models and methods using nonnumeric parallel optimization algorithm, genetic algorithm and simulated annealing algorithm, to adjust and control the production-injection system were made with taking the net present value as the objective function and coupling economic model, reservoir model, wellbore model including producer and injector, and choke model.

以净现值为系统目标，耦合经济模型、油藏模型、注采井筒模型和油嘴模型，首次建立利用非数值并行算法——遗传算法与模拟退火算法调控注采系统的理论模型与方法，对不同开发阶段与不同约束条件下的注采系统进行最佳调控，使之保持最优生产状态。

Considering the effect of interval on the original estimation accuracy and noise factors, the optimal interval, which minimizes estimation errors, is derived. It is related with MT's velocity. In order to reach the optimal interval, joint velocity estimation and interval calculation are applied. Finally, the feasibility of proposed algorithms is discussed.

通过对AWGN信道下的COV速度估计精确建模，数值分析了协方差计算间隔对COV算法本身精度及噪声因子的影响；根据分析的结果，以归一化平均误差最小为目标对估计算法进行了改进，获得了基于COV的精确速度估计；最后还对算法的可行性进行了讨论。

It is shown by the analysis of its time complexity and completeness as well as the numerical experiment that the proposed algorithm can achieve the goal of completeness and rapid convergence.

对算法进行的时间复杂度和完备性分析以及数值实验表明，基于遗传算法的粗糙集属性约简算法具有完备、快速收敛等特点。

The new approach improves the step length and the convergence is analyzed. Numerical examples are given to illustrate the effectiveness of the proposed method.

在此基础上提出了求解只带有等式约束的凸二次规划问题的新算法，该算法改进了搜索步长，分析了收敛性，通过数值算例验证了算法的有效性和优越性。

These three algorithms can avoid to recompute the nth order head submatrix of the Jacobi matrix. Moreover, the last two algorithms are more stable, their precision can match well with the algorithm of Boley and Golub.

这三种算法都可以避免重构Jacobi矩阵的n阶首主子阵，并且后两种算法更稳定，数值精度可以与Boley和Golub的算法媲美。

Moreover, we give some dual properties of these problems, and on this basis, we present a dual algorithm for solving the nonconvex conic model trust-region subproblem.

论文分析了这些问题的对偶性质，在此基础上，通过对偶提出了求解锥模型信赖域子问题的算法，同时证明了算法的全局收敛性以及局部Q-超线性收敛性，并给出了一些数值算例以说明算法的有效性。

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迭代校正的方法，构造了一种求导数零点的一种新算法。新算法在迭代过程中不用计算导数，且二阶收敛。数值试验表明，该算法具有较高的精度和较大的初值选择范

These three algorithms can avoid to recompute the nth order head submatrix of the Jacobi matrix. Moreover, the last two algorithms are more stable, their precision can match well with the algorithm of Boley and Golub.

这三种算法都可以避免重构Jacobi矩阵的n阶首主子阵，并且后两种算法更稳定，数值精度可以(来源：A1cBC论c4文网www.abclunwen.com)与Boley和Golub的算法媲美。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。