本文用最小二乘配置法求解正交异性极扁薄壳承受横向载荷作用下几何非线性弯曲问题。
This paper solves problems of geometrically nonlinear bending of very flat and thin orthotropic shell under transverse load with least square method of collocation.
对于一个确定的状态反馈极点配置问题，当采用不同的方法去求解时，可以得到不同的状态增益阵。
At meanwhile, it can be seen that different state gain matrix can be gotten by applying different solution method for a certain question of pole-placement of state feedback.
数值实验表明，径向基函数配置点方法与正则化方法耦合能有效求解椭圆型偏微分方程反问题。
It is concluded that the radial basis function collocation techniques coupled with regularization methods could be competitive alternatives to existing methods for these problems.
分别利用了共轭函数法与直接配置和非线性规划方法对异面最优变轨问题进行了求解。
Adjoint function algorithms and direct collocation and nonlinear programming methods are applied to resolve the non-coplanar optimal orbit transfers problem.
在GPCM中，利用类产品结构表示产品的显式结构知识，规则表示产品的隐式知识，从而降低了复杂机械产品配置问题的求解复杂度。
In the GPCM, generic product structure is used to describe structural knowledge and rules to represent the implicit knowledge, this reduce the complexity of mechanical product configuration.
通过适当的变换，将同时极点配置问题归结为一系列线性方程组的求解问题。
Through suitable transformations, the solution of the simultaneous pole assignment problem is resort to the solution of a number of linear equations.
给出了对于混合边值问题求解系统方程确定的边界轮廓方程配置和三次单元边界轮廓法的实施。
The mixed collocation of the formulations of the BCM is presented for the mixed boundary value problems.
讨论了搜索线上搜索力（密度）的最优配置问题，给出了求解的算法。并对其收敛性作了证明。
This thesis discussed the optimal arrangement of search-capacity on search-line. The algorithm for solving was given, and the convergence was proved.
通过对人力资源优化配置问题的讨论，给出了将该问题转化成求最大匹配问题的方法；通过用匈牙利算法求解对应的匹配问题，得出该资源分配问题的最优解。
Through the discussion of the optimum disposition of human resources, a method is proposed to transform the problem of the optimal match into the maximal match.
对于配置项较多的问题，由于搜索空间很大而不能用传统方法求解。
Traditional methods could not be applied to the problems with large amounts of configurable items because of large search space.
本文提出一种新的遗传算法用以求解这种机器配置问题，数值分析表明所构造的遗传算法对求解这类组合优化问题上是有效的。
Therefore, a new genetic algorithms approach is developed to deal with the problem. The numerical experiments show the effectiveness of the proposed method to this kind of problem.
根据限流措施优化配置问题的特点，提出先对候选可开断支路采用枚举法求解支路开断的优化方案，再采用改进离散粒子群算法(MDPSO)求解综合限流方案。
An enumeration method was used to get the optimal splitting of the candidate branches. A modified discrete particle swarm optimization algorithm (MDPSO) was used to get the final strategy.
根据限流措施优化配置问题的特点，提出先对候选可开断支路采用枚举法求解支路开断的优化方案，再采用改进离散粒子群算法(MDPSO)求解综合限流方案。
An enumeration method was used to get the optimal splitting of the candidate branches. A modified discrete particle swarm optimization algorithm (MDPSO) was used to get the final strategy.
应用推荐