查询词典 theorem

Taylor theorem use polynomial approximation function to link the known function with its derivative in different orders.

作为一元函数微分学的顶峰，Taylor定理重要的作用之一是在一个给定点的附近，将函数近似地用多项式来代替。

And then, the GFNN (generalized fuzzy neural network) is put forwand, the GFNN approximation theorem is proved.

从非线性系统本身的物理背景出发，根据系统本身的内在特性、先验知识和经验建立系统辨识模型，提出了广义模糊神经网络。

By using the interpolation mechanism of fuzzy system, an approach of building the series of fuzzy systems, which can uniformly approximate any continuous function on a compact domain to any accuracy, is given, and then the universal approximation theorem is generally proved.

利用模糊系统的插值模型来代替被控对象的真实模型，设计了一个自适应模糊控制策略；为保证系统的全局稳定性，增加了一个补偿控制律，它是根据模糊系统的逼近误差估计量来设计的，因此这里系统跟踪误差的收敛性不依赖于模型最小误差的平方可积性[70，71]。

The approximation theorem of the rough neural network is proved. Then the method is applied to the fault verification of fighter plane, the simulation results show that the rough neural network is efficient.

最后将此方法应用于歼击机的故障认定系统，仿真结果表示，此粗糙神经网络可以很好地对具有区间数的歼击机故障认定系统进行故障认定。

Thirdly, for Bernstein-Durrmeyer-Bezier operators, we have given the approximation equivalent theorem in L_p(1 ≤ p≤∞).

三、我们给出了Bernstein-Durrmeyer-Bézier算子于L_p(1≤p≤∞)空间中逼近的等价定理。

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型积分方程和常徽分方程的初值问题。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。