newton formula

newton formula的基本解释

-

牛顿公式

与newton formula相关的网络例句 [注：此内容来源于网络，仅供参考]

With the idea of smoothing Newton method, we propose a new class of smoothing Newton methods for the nonlinear complementarity problem based on a class of special functions. In this paper, complementarity problem is converted into a series of smoothing nonlinear equations and a modified smoothing Newton algorithm is used to solve the equations. We use Newton direction and Gradient direction together in the algorithm which guarantees that our method is globally convergent. Also using another smoothing function, we reformulate the generalized nonlinear complementarity problems defined on a polyhedral cone as a system of smoothing equations and a smooth unconstrained optimization problem. Theoretical results that relate the stationary points of the merit function to the solution of the generalized nonlinear complementarity problems are presented, we use the modified smoothing Newton algorithm in generalized nonlinear complementarity problems, under mild hypothesis, a global convergence is proved.

本文一方面基于现有的各种光滑Newton法的思想和半光滑理论，利用著名的F-B互补函数的光滑形式，首先将互补问题的求解转化为求解一系列光滑的非线性方程组，然后给出了一种修正的光滑Newton法，该方法不仅放宽对函数F的要求，在Newton方程不可解时引入初始效益函数的最速下降方向，而且光滑因子的选择也比较简单可行，同时在适当的条件下，证明了其算法具有全局收敛性；另一方面，借助另一种F-B光滑函数，将多面体锥上的广义互补问题转化为一种光滑形式，讨论了优化问题的稳定点与广义非线性互补问题的解之间的理论关系，并将这种修正的光滑Newton法用于求解广义非线性互补问题中，在适当的条件下，该算法同样具有全局收敛性。

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

In this paper, Newton iteration formula for computing normal depth and critical depth was put forward by mathematical transformation of uniform flow equation and critical flow equation of circular section tunnel. Then, the relationship between the corresponding central angle and the introduced parameters was analyzed. An approximate formula for angle was obtained according to optimal uniform approximation principle. Using this approximate formula as initial value of iteration formula, a direct formula for calculating normal depth and critical depth of circular section tunnel was established after its first iterative.

该文通过对圆形断面均匀流方程与临界流方程的数学变换，分别得到其正常水深与临界水深的牛顿迭代公式，同时，通过对正常水深与临界水深对应的中心角与引入参数之间关系的分析及数值计算，利用最优一致逼近原理分别得到了正常水深与临界水深对应中心角的近似计算式，并以此近似计算式为初值，用迭代方程进行一次迭代得到了圆形断面均匀流水深与临界流水深的直接计算公式。

与newton formula相关的网络解释 [注：此内容来源于网络，仅供参考]

newton formula：牛顿公式

newton diagram 牛顿多边形 | newton formula 牛顿公式 | newton identities 牛顿恒等式

newton interpolation formula：牛顿内插公式

newton first law 牛顿第一定律 | newton interpolation formula 牛顿内插公式 | newton law for heat loss 牛顿热耗定律

newton interpolation formula：牛顿插值公式

Newton identities 牛顿恒等式 | Newton interpolation formula 牛顿插值公式 | Newton interpolation polynomial 牛顿插值多项式

Newton's formula：牛顿公式

Newton-Raphson's method 牛顿 - 纳逊方法 | Newton's formula 牛顿公式 | Newton's law of motion 牛顿运动定律

Newton's formula：牛顿求积式

形状指数 form exponent | 牛顿求积式 Newton's formula | 里克求积式 Riecker's formula