查询词典 polynomial polyhedron

By using the Euclidean algorithm and invertible linear transformation over a polynomial ring, the solutions of polynomial indeterminate equations of first degree was investigated in theory, and its matrix solution based on the elementary matrix transformation was proposed.

利用欧几里德算法和多项式环上的可逆线性变换，从理论上对多项式环上的一次不定方程组的解进行深入的研究，给出了用矩阵的初等变换求解多项式环上的一次不定方程组的矩阵解法，并利用MATLAB数学软件开发了相应的计算机程序。

In addition,in the elementary theory of number through making use of primary transformation of matrix the quetient and remainder of first-degree.polynomial could be caculatedand this method should be spread applied to mth-degree polynomial,at last,the application of primary transformation would be spreaded in block matrix,here are the instances and explanation.

另外，在初等数论中，还可以用矩阵的初等变换来求一次带余除法的商及余式，并将其推广到一般除式为次多项式。最后把初等变换在分块矩阵中进行推广，并举例说明。

The direct displacement problem can be changed into solving a polynomial equation called the equivalent polynomial equation.

研究表明其正解问题最后可转化为一个高次多项式方程求解问题，称此方程为正解的等价多项式方程。

Compared with the traditional Euclidean algorithm, the proposed algorithm can easily get error value polynomial and error locator polynomial in the process of solving key equation. Moreover, it can simplify the complexity of hardware circuit and improve decoding speed.

与传统欧几里德算法相比，该算法在求解关键方程的过程中能够较容易地得到错误值多项式和错误位置多项式，从而可以减少硬件电路的复杂性，提高译码速度。

Compared with the traditional Euclidean algorithm, the proposed algorithm can easily get error value polynomial and error locator polynomial in the process of solving the key equation. Moreover, it can simplify the complexity of hardware circuit and improve RS decoding speed.

与传统欧几里德算法相比，该算法在求解关键方程的过程中能够更方便地得到错误值多项式和错误位置多项式，并且能够减少硬件电路的复杂性，提高RS码的译码速度。

Based on the platform of virtual instrument LabVIEW,this paper is to detect peaks of original signal respectively with power-weighted algorithm, Gaussian fitting algorithm, Gauss- polynomial fitting algorithm, a general polynomial fitting algorithm and Gaussian non-linear curve fitting algorithm, and compare their error means and standard deviations.

基于LabVIEW虚拟仪器开发平台，分析了功率加权算法、高斯拟合算法、高斯-多项式拟合算法、一般多项式拟合算法和高斯-非线性曲线拟合算法对原始信号寻峰，比较误差均值和标准偏差。

Simulation results demonstrate that memory polynomial model is more robust to delay estimation error than the general nonlinear polynomial model.

仿真结果表明，采用记忆多项式模型比一般多项式模型对延时估计偏差有更强的鲁棒性。

Some new formulae for the derivative bounds of parametric curves, such as the general polynomial curves and rational polynomial curves in CAGD, are presented.

对CAGD中常见的多项式曲线和有理多项式曲线的导矢的界提出了新的估计公式。

Since an analytic function can be arbitrary approximated by a polynomial, the provided methods can be applied to robust stability analysis of polynomial family with general non-linear perturbation parameters.

由于非线性解析函数可用多项式任意逼近，故该方法也可用于具有一般非线性参数摄动的多项式族的鲁棒稳定性分析。

Also the constructed curve is a shape-preserving curve for the original curve. We can also adjust the shape of curves by parameters of trigonometric uniform polynomial curve to approach the polygon closer. The general trigonometric polynomial curves with m degree and C(superscript 2m-1)(m=1, 2, 3) continuity are further presented.

除了通过切点参数，还可以通过三角均匀多项式曲线参数来调整曲线形状，使所得曲线更加逼近多边形，并可进一步、类似地可构造与给定多边形相切的C(上标 2m-1)(m=1， 2， 3)连续的m次三角多项式曲线。

The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.

组2的心脏解剖困难，表现为纤维组织坚韧，游离肺动脉非常困难；徒手无法松解左、右纤维三角，肺动脉和主动脉根部的游离非常困难；心肌纤维坚硬、质脆，解剖时容易断离成碎块，无法沿纤维走行方向剥离。

We have battled against the odds in a province that has become increasingly violent.

我们对在一个争夺日益激烈省的可能性。