求解

Because assembly constraint solving is required frequently in assembly design, to improve solving efficiency and stability considerately are of great importance to real time requirement in engineering.

由于装配设计中，设计变量、零件模型的修改之后都需要重新求解装配约束以便得到新的实体装配模型，因此提高装配约束的求解效率和求解稳定性对于满足工程设计中的实时性要求具有重要意义。

Then a quasi -Newton decent numeric algorithm for solving the consistent equations is presented and applied to solving the simultaneous simulation problem.

先运用多项式分解，将严格正则线性系统同时镇定问题化成一组相容非线性方程的求解，然后提出了一种求解相容非线性方程组的拟牛顿下山数值算法，并应用该方法求解同时镇定问题。

Take the method of "subarea" and "conjunction" to segment the whole request model to three parts. Making use of boundary continuousness between medium and lining structure at stress and displacement, construct a wave function that can satisfy the stress boundary condition at horizontal surface by the scattering of SH-waves in circular part. And then, availing of the wave function, conjoin the circular part into the semi-circular hollow space at common boundary. The problem can be reduced to solve the question that can only meet the condition of "conjunction". Finally, the solution of the problem can be summarized to a series of algebraic equations and solved numerically by truncating the finite terms of the infinite algebraic equations.

采用"分区"与"契合"的方法，将整个求解区域分割成三部分，利用介质与衬砌结构在边界上的应力、位移的连续性，构造一个可以自动满足水平界面上应力边界条件的圆域对SH波散射的波函数；再利用这一波函数将圆域与半圆形凹陷半空间的"公共边界"进行"契合"，将问题简化成对一个只需满足'契合'边界条件的散射问题的求解；最终归结为对一组无穷代数方程组的求解问题，利用截断有限项的方法对其进行计算。

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

The bending of rectangular plate is divided into the generalized statically determinate bending and the generalized statically indeterminate bending based on the analysis of the completeness of calculating condition at the corner point. The former can be solved directly by the equilibrium differential equation and the boundary conditions of four edges of the plate.

在分析角点求解条件完备性的基础上将矩形板弯曲划分为广义静定问题和广义超静定问题，广义静定弯曲可以由板的平衡微分方程及四边边界条件直接求解，广义超静定弯曲可以由叠加法求解。

A numerical method, where the pressure is used as a primary dependent variable, is presented for the solution of the two-dimensional steady Navier-Stokes equation in general curvilinear coordinates.

本文采用了求解压力速度耦合的SIMPLE算法，以压力为主要求解变量对Navier-Stokes方程进行数值求解。

A numerical method, where the pressure is used as a primary dependent variable, is presented for the solution of the two-dimensional steady Navier-Stokes equation in general curvilinear coordinates. SIMPLE (Semi-Implicit Method for Pressure Linked Equations) is mainly adopted.

本文首先详细推导了二维任意曲线坐标系下张量形式的流动控制方程及其和压力修正方程的离散形式，应用求解压力速度耦合的SIMPLE算法，以压力为主要求解变量对Navier-Stokes方程进行数值求解。

CBFEC emphasizes direct correspondence of concepts in EC with its software architecture for ease of understanding and using; minimal coupling with specific problem structure for easy adaptation it to solve a large number of wholly different problems; interface-centered design for extendibility. To achieve those objects, the problem-solving method of EC is analyzed and the problem-solving procedure of EC is divided into three interactive aspects: population-based stochastic searching mechanism, problem specific information to implicitly guide the stochastic searching, and the observation and control of the computation procedure of EC. Then the key concepts of EC are identified in those three aspects; the normal implementations of those concepts are summarized; the interfaces represents those concepts in software are abstracted; the collaborations of components through those interfaces are designed. CBFEC is implemented on mainstream component software platform COM/DCOM (Component Object Model/Distributed COM from Microsoft), which includes interfaces definitions, commonly using EC components implemented those interfaces, such as Simply EA component, Steady State EA component, EA component, EA component, Population component, Tournament Selection component, Linear Ranking Selection component, Nonlinear Ranking Selection component, Random Number Generator component, etc, and the collaborations of those components through those interfaces.

具体的做法是把演化计算看作是基于组件的软件工程的一个应用领域：首先分析了演化计算求解问题的一般思路和方法，把演化计算问题求解过程分为："设计基于群体的随机搜索机制"、"研究问题的性质并以此隐含地定义算法的搜索方向"和"求解过程的观察与控制"三个部分；然后分别找出各个部分中的关键概念，总结这些概念现有的一般实现方法，抽取其本质，以此结合设计模式来定义组件软件的接口；通过分析演化计算各个概念之间的相互联系来设计组件软件间通过接口的进行交互的方式；最后还在目前一种主流组件软件开发平台COM／DCOM（微软提出的组件对象模型）的基础上实现了常用的演化计算组件，如简单演化算法组件、稳态演化算法组件、演化算法组件、演化算法组件、种群组件、锦标赛选择策略组件、线性排名选择策略组件、非线性排名选择策略组件、随机数发生器组件等等。

It transforms the solving of the domain of attraction into an iterative optimization problem and gives algorithm for this solution. It also gives the tuning algorithm for achieving desired domain of attraction.

将吸引域的求解化为迭代求解的优化问题，给出了求解算法和满足给定吸引域要求的控制器的调整方法。

In chapter four of this paper, based on the theory of chapter two, by applying the oblique elementary of matrix or the second oblique elementary of matrix, the algorithm for solving the greatest common factor is presented. Thus the solving of the greatest common factor becomes fast simple and practical.

在第四章中，以第二章作为理论基础，提供了分别依据第一斜消法、第二斜消法求解最大公因式的算法实现过程(具体为算法1、算法2)，实现了最大公因式求解的计算机编程处理，使多项式组的最大公因式的求解变得快速、简便、实用。

Neither the killing of Mr Zarqawi nor any breakthrough on the political front will stop the insurgency and the fratricidal murders in their tracks.

在对危险的南部地区访问时，他斥责什叶派民兵领导人对中央集权的挑衅行为。

In fact,I've got him on the satellite mobile right now.

实际上 我们已接通卫星可视电话了