求解过程

In the solution process, the basis vectors can be obtained from the matrix perturbation or the Neumann series, and then the Epsilon-algorithm was used to obtain the approximate eigenvectors.

在求解过程中，利用Neumann级数产生基向量，然后用Epsilon算法求出近似特征向量，最后用Rayleigh商分析，求出了修改后结构的近似特征值和特征向量。

This make it difficult to know the essence of fluidized beds. In order to viewthe motion behavior of a single particle in a fluidized bed in a reasonable cost, thegas-solid flow in a fluidized bed is modeled by a combined approach of discrete particlemethod and computational fluid dynamics, in which the motion ofindividual Particles is obtained by solving Newton\'s second law of motion and gas flowby the Navier-Stokes equation based on the concept of local average.

为了用数值模拟方法来弥补传统实验方法的不足，达到从单个颗粒的尺度上来研究流化床中颗粒的运动和气体流场的剧烈变化情况的目的，本论文建立了基于用Newton第二定律计算单个颗粒运动轨迹的离散颗粒法和基于区域平均值的计算流体动力学方法的数学模型的建立和求解过程；并依据Newton第三定律建立了DPM模型和CFD模型的耦合模型，编写和调试了DPM和CFD的耦合程序。

On the same time, numerical computed method is utilized to solve the normal distribution function for the precision of computer.

同时利用数值计算方法，对求解过程中正态分布函数的计算进行了适当的数值处理以满足计算方法的要求。

Numerical algorithms process doesn't depend on initial. It has good numerical stability.

数值求解过程没有初值依赖性，具有很好的数值稳定性。

A direct optimization method of designing optimal dynamic output feedback control system is developed so that the solving problem is simplified.

给出了设计动态输出反馈控制系统的直接优化方法，简化了问题的求解过程。

A special type of half-plane problems of elasticity is presented and discussed. By using two methods in polar coordinates and orthogonal coordinates respectively, the analytical expressions of stress components are solved in the two coordinates. There are little differences between both results, which confirm the equivalence of the two methods.

针对一类特殊的弹性半无限平面问题，分别给出了其在极坐标系与直角坐标系下的求解过程，获得了在这两种坐标系下应力分量的解析表达式，并对这两种解法的结果进行了比较与讨论。

And corresponding penalty function method for solving them is also introduced.

在Matlab环境下编写了计算程序，实现了求解过程。

There exist some disadvantages in several common methods for solving the Poisson equation of PN junction, and so a new ameliorative arithmetic was presented.

摘 要：针对在PN结泊松方程求解过程中几种常用方法存在的不足，提出一种改进算法。

In the solution process the initialization two populations, separately will select the different overlapping variation probability, after each time will iterate the sufficiency high individual carries on the first populations in sufficiency low individual with the second population in the exchange, and will preserve each center group the optimal solution to the outstanding person population, by will solve the tradition genetic algorithms to be easy to appear precociously, will be easy to fall into the partial optimal solution question.

即在求解过程中将初始化两个种群，分别选取不同的交叉变异概率，在每一次迭代完后将第一个种群之中的适应度较低的个体与第二个种群中适应度较高的个体进行交换，并且保存每个种群的最优解到精英种群，以解决传统遗传算法容易出现早熟，容易陷入局部最优解的问题。

In the solution process the initialization two populations, separately will select the different overlapping variation probability, after each time will iterate the sufficiency high individual carries on the first population's in sufficiency low individual with the second population in the exchange, and will preserve each center group the optimal solution to the outstanding person population, by will solve the tradition genetic algorithms to be easy to appear precociously, will be easy to fall into the partial optimal solution question.

即在求解过程中将初始化两个种群，分别选取不同的交叉变异概率，在每一次迭代完后将第一个种群之中的适应度较低的个体与第二个种群中适应度较高的个体进行交换，并且保存每个种群的最优解到精英种群，以解决传统遗传算法容易出现早熟，容易陷入局部最优解的问题。

But we don't care about Battlegrounds.

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

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

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