多项式

Based on the linear MIMO model of Volterra system for blind identification, the blind identification method of Volterra system based on the basis of the noise polynomial vector space is presented.

基于 Volterra 系统盲辨识的线性 MIMO 模型，提出了基于噪声多项式向量空间基的 Volterra 系统的盲辨识方法。

This paper presents the superdefinite equations coefficient matrix can be decomposed in QR form using modified Gram-Schmidt orthogonal and the accurate passive macromodel in time domain can be constructed based on Bernoulli polynomial root finding method and the formulae for stability and passivity.

该文提出利用修正Gram-Schmidt正交化处理对超定方程组系数矩阵进行正交三角分解，结合Bernoulli多项式求根方法及稳定、无源性准则可以精确构建无源时域宏模型。

In addition, the comparison with Nelson-Aalen method is presented and the selection of the degree for Bernstein polynomial is discussed.

另外，我们的方法与尼尔生-艾伦方法的比较，和伯氏多项式阶数之选取亦为本文讨论的议题。

In curve and surface modeling, Bernstein polynomial compositions are widely used for various geometric operations. So it is important to investigate them both in theory and practice.

在曲线曲面造型中，Bernstein多项式复合被广泛用于许多几何操作，因而具有重要的理论和实际意义。

We try to use a modified Bernstein polynomial to reduce the number of variables when calculating the circle array. Finally we use PSO to optimize the circle array and obtain a beam form with a flat top which is needed in the practical design.

在计算圆环阵时尝试引入了修正的波恩斯坦多项式以减少需要优化的变量，并结合工程上的需要，用粒子群优化算法给圆环阵赋行计算得到了主波瓣是平顶的方向图。

These curves contain a shape parameter which can adjust the softness of curve and have the same continuity with the original B-spline. In succession, using the positive conditions of Bernstein polynomial to find a range in which the shape parameter takes its value so as to make the corresponding interpolating curves monotonicity-preserving and C~2 continuous.

利用奇异混合的思想构造出一类带有形状参数的多项式样条曲线，即均匀α-B样条曲线，在无需反求方程组、迭代过程和最值求解的情况下就能轻松做到插值给定的点列；它含有形状参数α，这就增加了曲线的柔性，同时又和原B样条曲线具有相同的参数连续性。

In this paper the degree of approximation by n-dimensional Bernstein polynomials is discussed.

本文讨论了k维空间的伯恩斯坦多项式在不同的距离下的逼近度。

Function approximation; best uniform approximation polynomial; deviation point; FPGA

函数逼近；最佳一致逼近多项式；交错点；FPGA实现

For the given endpoint interpolation conditions, a new approximation method of multidegree reduction is presented. Using Chebyshev polynomial approximation theory, the nearly best uniform approximation under the interpolation conditions of endpoints can be obtained.

对于给定的首末端点的各阶插值条件，给出了一种新的一次降多阶逼近算法，应用Chebyshev多项式逼近理论达到了满足端点插值条件下的近似最佳一致逼近。

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实现的函数逼近新方法：通过区间映射关系，将函数定义域映射到较小的逼近区间内，并按照交错点对逼近区间进行分段，分别求出每段的最佳一致逼近多项式，对函数进行分段逼近，最后将逼近结果反映射，得到最终的函数计算结果。

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.

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