多项式定理

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逼近定理为桥梁，证明了该模糊系统可以以任意精度逼近一个任意的连续函数，从而得到了该模糊系统万能逼近性的一个新的充分条件。

This paper discussed the theorem of the average arithmetic geometric mean of algebraic polynomials systematically, then derived and analyzed the original geometric programming briefly.

系统地讨论了代数多项式的算术－几何均值定理，并对原型几何规划理论作出了简明的推导与分析。提出了具有缩并迭代特性的几何规划求解理论和编程步骤。

We divide this interval into several subintervals, based on deviation points, find the best uniform approximation polynomial of each subinterval, and then denormalize the computation result to the final result.

论文摘要：根据切比雪夫定理，提出了一种适于FPGA实现的函数逼近新方法：通过区间映射关系，将函数定义域映射到较小的逼近区间内，并按照交错点对逼近区间进行分段，分别求出每段的最佳一致逼近多项式，对函数进行分段逼近，最后将逼近结果反映射，得到最终的函数计算结果。

There exist Engel groups for each of which the Engel length of the product of two elements is not bounded by any polynomial function of the Engel lengths of the factors.

定理1。每个团体存在的恩格尔恩格尔产物长度两个因素并不是什么北临多项式函数恩格尔长度因素。

Rational polynomial coefficient in the Rational domain can not be the judge about substituting mathematical theorem is the most important issue.

有理系数多项式在有理数域上不可约的判定定理是代数学中的重要问题。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

In Chapter 1,some elementary knowledge was introduced,such as theBernstein-Bezier representation for polynomials,conform triangulation,theconditions of convexity for Bézier spline surfaces,the funtional andgeometric continuity condition for neibour Bézier surface patches etc.,specially,based on the Liu-Ding-Yuan Theorem for geometric continuity,some simple and practical conditions were obtained.

第一章介绍一些基本知识，如多项式的Bernstein-Bézier表示，相容三角剖分的定义，Bézier三角样条曲面保凸的条件，相邻Bézier曲面片函数连续和几何连续的条件等，特别地，在刘鼎元关于几何连续条件的一般定理的基础上，导出了几个较简单的实用的一阶几何连续条件。

For the case that the eigenstrains is in the form of linear function of Cartesian coordinates of the points of the inhomogeneity, the solution for the stress and strain fields is analytically derived based on the polynomial conservation theorem, the complex function method and conformal transformation together with the principle of minimum strain energy.

对于夹杂的特征应变为线性分布的情况，基于多项式保守定理，运用复解析函数法、保角变换和最小势能原理，获得了问题的封闭形式的解析解。

We study single machine earliness/tardiness scheduling problems with a common due window, and the size of the common common due window is arbitrary.

分别提出了定理和多项式时间算法确定了这两类调度问题的最优公共交货期和最优排序。

This paper explores ways to prove fundamental theorem of algebra with mathematical analysis.

该证明从复变多项式无非零最小模引入，并在此基础上简单证明了代数学的基本定理。

I didn't watch TV last night, because it .

昨晚我没有看电视，因为电视机坏了。

Since this year, in a lot of villages of Beijing, TV of elevator liquid crystal was removed.

今年以来，在北京的很多小区里，电梯液晶电视被撤了下来。