In the method, the interior grid distribution is controlled by prior selection of the grid point distribution along the boundaries of the region.
本文采用了一种利用边界网格节点分布信息来控制区域内部网格节点分布的网格生成技术。
Trust region interior point method can settle the problem of adjusting step sizes on successive linear programming well.
信赖域内点法可以很好地解决逐线性规划方法中的步长调整问题。
This method fills the interior of a closed cardinal spline that passes through each point in the array.
此方法填充经过该数组中每一点的闭合基数样条的内部。
A new segment solution for solving load margin of AC/DC power system is proposed in this paper based on continuation method and interior point algorithm.
基于连续潮流法和原始一对偶内点法，提出了一种新的分段求解交直流系统负荷裕度方法。
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system.
内点法是一种求解线性规划问题的多项式时间算法，其显著特征是其迭代次数与系统规模关系不大。
The primal-dual interior point method can solve effectively the problem with a lot of constraints resulting from the motion equations of the generator rotors with the result of perfect convergence.
而原始-对偶内点法完全可以很好地解决由于发电机转子运动方程的引入带来的大量约束问题，具有极好的收敛特性。
Recently, a combined homotopy interior point method (denoted as CHIP method for convenience) was presented to solve a class of nonlinear programming problems.
最近学者们提出了组合同伦内点法（简记为CHIP方法）去求解一类非线性规划问题。
The Hessian matrix of every function in this model is constant, so it will be calculated once in the entire optimal process based on interior point method, which speeds up each iteration.
该新模型的海森矩阵是精确的常系数矩阵，在内点法迭代过程中只需要计算一次，从而缩短了每次迭代的计算时间。
A new method, which combines the adaptive immune algorithm (AIA) with predictor-corrector interior point method, was presented for the reactive power optimization of power system.
在分析原-对偶内点法和连续性潮流方法计算系统输电能力各自优缺点的基础上，将两者结合，提出了一种系统输电能力的综合计算方法。
Reactive power optimization based on interior point method is studied in this thesis as that GA's calculation speed can not satisfy the requirement of real time voltage control.
由于遗传算法的计算速度难以满足实时电压控制的要求，本文进行了基于原-对偶内点法的无功优化算法的研究。
The problem for getting K T point of nonlinear programming by combined homotopy interior point method under linearly independent constraint qualification is discussed at [1].
文献 [1 ]讨论了在线性无关的约束规定下 ，用组合同伦内点法求解非线性规划的KT点问题。
The problem for getting K T point of nonlinear programming by combined homotopy interior point method under linearly independent constraint qualification is discussed at [1].
文献 [1 ]讨论了在线性无关的约束规定下 ，用组合同伦内点法求解非线性规划的KT点问题。
应用推荐