查询词典 theorem

Using the information consistency principle, the first step of the algorithm transforms the identification problem into a constrained convex programming ,the result of which is then used ,in the second step, to approximate systems in the uncertainty set to obtain the identified nominal model based on a polynomial approximation theorem.

第一步通过信息一致性原理把辨识问题转化为受限凸规划问题，第二步利用一个多项式逼近定理在第一步结果基础上，对不确定集中的系数进行逼近，得到辨识出的名义模型。

To cousider the least,we have to establish these facts under some comparablystrong but not the most proper conditions.From [12] and [13],if we suppose thatfis Lipschitz continuous in t,then all the above conditions(H1)-(H3) canbe established to a class of approximating problems of (1)(2).So the followingtheorem can be proved by theorem 5 through approximation process.

这时，我们只好"退而求其次"，在较强的"看来不是最适当的条件"下，来建立这些事实，从[12]和[13]中我们看到，只要加上"〓对t为Lipschitz连续"，则对（1）（2）的逼近问题族，上述条件（H1）-（H3）都可建立起来，从而，通过逼近过程，用定理5就可得到如下的定理。

Secondly, the approximation equivalent theorem for Bernstein-Kantorovich-Bezier operators have been studied by using of smooth modulus ω_φ_p in the space L_p(1 ≤ p≤∞).

二、利用光滑模ω_φ_p和与之相对应的K泛函研究了Bernstein-Kantorovich-Bézier算子于L_p(1≤p≤∞)空间中的逼近正、逆定理和等价定理。

The zonal translation networks on the unit sphere is constructed with the best approximation of spherical harmonic polynomials and the Riesz means. The Jackson theorem of approximation by such kind of zonal translation is established.

借助于球调和多项式的最佳逼近多项式和Riesz平均构造出了单位球面S上的带形平移网络，并建立了球面带形平移网络对LS(上标 q中函数一致逼近的Jackson型定理。

In Section 1, without assuming operators to be continuous and cones to be normal, we use the Monchs compactness condition to study the existence and iterative approximation theorem of solutions and coupled minimal and maximal quasi-solutions for a class of nonlinear operator equations x = Ax, x under more extensive and weaker conditions than those used in [18] in ordered Banach spaces.

践一节中，利用M加ch的紧性条件，在比文献［18］更广泛的较弱的条件下，在不假潞子连续和拄酬的前提下，研究了Ball''crl空间中一描F线腑子方程X—川巳F）的解和最小最大耦合解的存在与迭代跳定理，并应用到Ban呐空间中非线性VOlterra型积分方程和常徽分方程的初值问题。

The random phase approximation method and the Feymann-Hellman theorem are used to calculate the seventh order glueball mass of the 2+1-D SU(2) lattice gauge theory.

采用无规相近似方法，用空心图作为试探波函数，利用Feymann Hellman定理计算七阶 2 + 1维SU(2 )格点规范场的胶球质量，在弱耦合区 1/g2 =1。

The proof relies on regular approximation, the fixed point theorem, the embedding theorems, the semigroup theory and a series of complicated estimates.

然后，利用此结果，通过区域正则化逼近及半群理论获得各种估计，并给出了非齐次Liouville-Poisson模型的整体古典解。

Koopmans theorem is an approximation in molecular orbital theory , such as density functional theory , or Hartree-Fock theory, in which the first ionization energy of a molecule is equal to the energy of the highest occupied molecular orbital, and the electron affinity is the negative of the energy of the lowest unoccupied, i.e.

如同密度泛函理论或者Hartree－Fock理论，分子轨道理论中常用到的Koopmans 定理也是一种近似。

By the best approximation theory, it is first proved that the SISO (single-input single-output) linear Takagi-Sugeno fuzzy systems can approximate an arbitrary polynomial which, according to Weierstrass approximation theorem, can uniformly approximate any continuous functions on the compact domain.

借助于最优逼近理论，证明了线性SISO TS模糊系统可以逼近任意一个多项式，然后以Weierstrass逼近定理为桥梁，证明了该模糊系统可以以任意精度逼近一个任意的连续函数，从而得到了该模糊系统万能逼近性的一个新的充分条件。

Secondly, using the relation between the weighted modified K-functional, the weighted modulus of smoothness ,the weighted main-part modulus of smoothness . we get the pointwise direct and inverse approximation theorem with Jacobi weight for Szdsz-Kantorovich operator. Thus some results on w = 0w(x denotes the weight function, Ditzian-Totik modulus and classic modulus are extend.

其次，引入一种改变的带权K-泛函，利用带权光滑模和带权主部光滑的关系及带权光滑模与改变带权K-泛函的等价性，关于Szász-Kantorovich算子，讨论了一阶矩不为零的算子的点态带Jacobi权逼近正定理及等价定理，推广了已有的权为零及Ditzian-Totik光滑模和古典光滑模的结果。

Liapunov—Schmidt method is one of the most important method in the bifurcation theory.

Liapunov—Schmidt方法是分叉理论的最重要方法之一。

Be courteous -- even when people are most discourteous to you .

要有礼貌──即使当別人对你最不礼貌的时候。