查询词典 quadratic

Sufficient conditions of linear and quadratic feedback stabilizability are obtained for nonlinear systems with uncontrollable critical mode (a single zero eigenvalue, or a pair of pure imaginary eigenvalues), corresponding algorithms are given for constructing stabilizing laws.

结合中心流形方法和范式理论研究了临界情形下非线性系统的稳定性问题，针对临界模态为单零特征值、一对纯虚特征值和一对零特征值的情形，分别获得了渐近稳定或不稳定的充分条件，给出了相应稳定性判据。

And under suitable conditions,we establish the global convergence and locally superlinear/quadratic convergence of the method.

在适当条件下，建立了算法的全局和局部超线性/二阶收敛性

To the tangent distance minimization method,it's quadratic convergence for zero residual problems may not convergence at all.

对于切线距离最小方法，它是接近二次相交零余留的问题，也有可能没有相交。

Locally quadratic convergence is also obtained, compared with the locally superlinear convengence of Chen-Xiu's.

在一定意义下，光滑化函数是延拓算法的核心。

In Section 2 of Chapter 1, we develop the SDA algorithm from a new point of view and show its quadratic convergence under assumptions which are weaker than stabilizability and detectability.

并且我们可在比可稳定化与可侦测化更弱的假设条件下，更进一步证明此一保结构算法的二次收敛性。

Simulating in the IEEE30 bus system, the results show that the global sequential quadratic programming algorithm has favorable convergence and accuracy.

对IEEE30节点系统进行无功优化仿真，结果表明全局SQP算法具有良好的收敛性和精确性。

They didn't possess strong convergence and quadratic convergence rate,more-over,their convergence properties and rate of convergence were only local.

无强收敛性和二次收敛率，甚至收敛性与收敛速度只是局部的。

The algorithm has quadratic convergence and can speed up the EM computation.

该方法基于拟牛顿加速算法，并结合一种带调整参数的Broyden对称秩1校正公式来实现，具有二次收敛性，提高了EM的计算速度，降低了计算复杂度。

In order to convert this constraint to smooth ones in general form, an enhancing constraint transcription is adopted, thus the convergence of sequential quadratic programming method is guaranteed.

TCSC暂态10s运行约束可表示为过程不等式约束的形式，为将这一约束条件处理为具有标准形式的光滑约束函数，文中扩展了已有的变换技巧，从而保证了SQP法有较好的收敛性。

Based on it, a new efficient implementation of preconditioned conjugate gradient is put forward to solve the Gauss-Newton equation and save the cost on computation with the same exactly quadratic convergence to the traditional choleski factorization.

新算法与传统的使用Choleski技术的Gauss-Newton法具有相同的收敛速率，但在求解 Gauss-Newton方程组时减少了代数运算的计算量。

Plunder melds and run with this jewel!

掠夺melds和运行与此宝石！

My dream is to be a crazy growing tree and extend at the edge between the city and the forest.

此刻，也许正是在通往天国的路上，我体验着这白色的晕旋。