查询词典 andre polynomial

Firstly, this paper describes the history and state of the research to the minimal polynomial and the characteristic polynomial and then gives the main methods and its computational complexities for computing the characteristic polynomial and of a constant matrix, the characteristic polynomial of a polynomial matrix and the minimal polynomial of a polynomial.

本文先叙述了对最小多项式和特征多项式的国内外的研究历史和现状，然后给出了已有的计算常数矩阵特征多项式、多项式矩阵的特征多项式和常数矩阵最小多项式的主要算法及其复杂性。

First, we introduce and discuss the various methods of multivariate polynomial interpolation in the literature. Based on this study, we state multivariate Lagrange interpolation over again from algebraic geometry viewpoint:Given different interpolation nodes A1,A2 .....,An in the affine n-dimensional space Kn, and accordingly function values fi(i = 1,..., m), the question is how to find a polynomial p K[x1, x2,...,xn] satisfying the interpolation conditions:where X=(x1,X2,....,xn). Similarly with univariate problem, we have provedTheorem If the monomial ordering is given, a minimal ordering polynomial satisfying conditions (1) is uniquely exsisted.Such a polynomial can be computed by the Lagrange-Hermite interpolation algorithm introduced in chapter 2. Another statement for Lagrange interpolation problem is:Given monomials 1 ,2 ,.....,m from low degree to high one with respect to the ordering, some arbitrary values fi(i= 1,..., m), find a polynomial p, such thatIf there uniquely exists such an interpolation polynomial p{X, the interpolation problem is called properly posed.

文中首先对现有的多元多项式插值方法作了一个介绍和评述，在此基础上我们从代数几何观点重新讨论了多元Lagrange插值问题：给定n维仿射空间K~n中两两互异的点A_1，A_2，…，A_m，在结点A_i处给定函数值f_i(i=1，…，m)，构造多项式p∈K[X_1，X_2，…，X_n]，满足Lagrange插值条件：p=f_i，i=1，…，m (1)其中X=(X_1，X_2，…，X_n)，与一元情形相似地，本文证明了定理满足插值条件(1)的多项式存在，并且按"序"最低的多项式是唯一的，上述多项式可利用第二章介绍的Lagrange-Hermite插值算法求出，Lagrange插值另一种描述是：按序从低到高给定单项式ω_1，ω_2，…，ω_m，对任意给定的f_1，f_2，…，f_m，构造多项式p，满足插值条件：p=sum from i=1 to m=Ai=f_i，i=1，…，m (2)如果插值多项式p存在且唯一，则称插值问题适定。

First, we introduce and discuss the various methods of multivariate polynomial interpolation in the literature. Based on this study, we state multivariate Lagrange interpolation over again from algebraic geometry viewpoint:Given different interpolation nodes A1,A2 .....,An in the affine n-dimensional space Kn, and accordingly function values fi(i = 1,..., m), the question is how to find a polynomial p K[x1, x2,...,xn] satisfying the interpolation conditions:where X=(x1,X2,....,xn). Similarly with univariate problem, we have provedTheorem If the monomial ordering is given, a minimal ordering polynomial satisfying conditions (1) is uniquely exsisted.Such a polynomial can be computed by the Lagrange-Hermite interpolation algorithm introduced in chapter 2. Another statement for Lagrange interpolation problem is:Given monomials 1 ,2 ,.....,m from low degree to high one with respect to the ordering, some arbitrary values fi(i= 1,..., m), find a polynomial p, such thatIf there uniquely exists such an interpolation polynomial p{X, the interpolation problem is called properly posed.

文中首先对现有的多元多项式插值方法作了一个介绍和评述，在此基础上我们从代数几何观点重新讨论了多元Lagrange插值问题：给定n维仿射空间K~n中两两互异的点A_1，A_2，…，A_m，在结点A_i处给定函数值f_i(i=1，…，m)，构造多项式p∈K[X_1，X_2，…，X_n]，满足Lagrange插值条件：p=f_i，i=1，…，m (1)其中X=(X_1，X_2，…，X_n)，与一元情形相似地，本文证明了定理满足插值条件(1)的多项式存在，并且按&序&最低的多项式是唯一的，上述多项式可利用第二章介绍的Lagrange-Hermite插值算法求出，Lagrange插值另一种描述是：按序从低到高给定单项式ω_1，ω_2，…，ω_m，对任意给定的f_1，f_2，…，f_m，构造多项式p，满足插值条件：p=sum from i=1 to m=Ai=f_i，i=1，…，m (2)如果插值多项式p存在且唯一，则称插值问题适定。

It is proved that if'sparse NP complete sets under polynomial-time Turing reductions exist'then 'SAT is polynomial-time non-adaptively search reducible to decision', and that if 'P is not equal to NP'then either'SAT is not polynomial-time non-adaptively search reducible to decision'or'SAT is not polynomial-time truth-table reducible to bounded approximable sets', and that if'P is not equal to NP'then'sparse complete sets for NP under polynomial-time disjunctive reductions do not exist'.

因为用现有的证明技术不可能绝对地解决这个假设，本文研究了这个假设与其他关于SAT结构性质的假设之间的关系，证明了如果'NP有多项式时间图灵归约下的稀疏完全集'则'SAT是多项式时间并行地搜索归约为判定'，以及如果假设'P不等于NP'，则要么'SAT不是多项式时间并行地搜索归约为判定'，要么'SAT不能用多项式时间真值表归约归约为有界可近似集'。

When to get the coefficients of polynomial directly,the ill-conditioned matrix may be produced and effect the precision of result.Using orthogonal polynomial can avoid this problem.This paper introduces 4 orthogonal polynomial.In our discussion,it is proposed to use Chebyshev polynomial and Legendre polynomial,they are easier to sa...

讨论4种常用正交多项式在拟合卫星轨道与时间函数时的适用性；通过计算实例说明利用切比雪夫多项式和勒让德多项式做数据拟合时具有很高的精度；分析得出评定多项式拟合数据精度的适用阶数，实际应用中可降低工作量，提高计算效率；最后讨论同一多项式阶数下不同历元数对拟合结果的影响。

A new method that transforms bitlevel waveform polynomial to word-level polynomial model is given, allowing for simple composition This method offers an efficient way to determine whether two descriptions from different design levels are equivalent, so component reuse, synthesis and verification across design levels can be realized. In addition, an experimental system using C language is established, including modules such as representation of waveform polynomial, decision of path senstization, delay computing, clocking based on single-period sensitization, clocking based on multi-period sensitization, test generation considering noise and transformation from bit-level waveform polynomial to word-level polynomial model. They respectively used to test models and techniques proposed in this paper.

另外，基于C语言本人设计开发了一个实验软件系统，该系统包括波形多项式表示模块、敏化通路判定模块、延时计算模块、单周期敏化的最小时钟周期精确确定模块、多周期敏化的最小时钟周期确定方法模块、考虑噪声的测试生成模块和位级波形多项式描述转化成字级多项式描述模块，分别用于对本文各章中提出的自动化设计的模型和方法进行实验验证。

Some basic properties of σ- LFSR over F4 are studied, such as nonlinearity, cycle structure distribution of state graph, the largest period and counting problem related. The conclusions are as follows:The coefficient ring of σ-LFSR is isomorphic to the matrix ring over F,. The cycle structure of σ- LFSR is consistent with that of the determinant of the corresponding polynomial matrix if and only if the feedback polynomial of - LFSR does not contain nontrivial factor over F2,. The counting formula of the number of σ- LFSR with inconsistent cycle structure is also showed in that part. The period of σ-LFSR with degree n is maximum if and only if the determinant of the corresponding polynomial matrix is the primitive polynomial with order 2n over F2,.

本文研究了有限域F_4上的σ-LFSR的一些基本性质，如非奇异性、状态图的圈结构的分布、最大圈的充要条件及相关的计数问题等，得到以下结论：σ-LFSR的系数环同构于F_2上的矩阵环；σ-LFSR的状态图的圈结构与对应的多项式矩阵的行列式的圈结构一致的充要条件为σ-LFSR的反馈多项式不含有非平凡的F_2上的因式，给出了圈结构不一致的σ-LFSR的计数公式； n次σ-LFSR周期达到最大，当且仅当对应多项式矩阵的行列式为F_2上的2n次本原多项式。

The method includes steps: each point in sequence x with length L, i=0, 1, 2,apostrophe L-1 is served as a independent variable of k order polynomial; changing coefficient of polynomial to generate multiple sequence f with length L, where k is nonnegative integer; operation in polynomial is carried out in Galois Field GF, where Q=pm, p as a prime number, and m as nonnegative integer; assigning generated sequences to multiple sectors to set of create biased sequences for each sector; it is different in constant terms of polynomial, and identical to other coefficients of coefficients corresponding to sequence assigned to same sector; creating corresponding time - frequency pattern unit from biased sequences of the sector; repeating TFP unit with equal interval in frequency domain so as to obtain integrated TFP.

本发明涉及一种时频资源的分配方法，所述方法包括：把一个长度为L的序列{x，i＝0，1，2，…L-1}中的每一点作为一个k次多项式的自变量，改变多项式的系数生成多个长度为L的序列{f}，其中k是非负整数，多项式中的运算在伽罗华域GF中进行，其中Q＝p m ，p是一个素数，m是非负整数；把生成的序列分配给多个小区，生成各小区的偏置序列集合，其中分配给同一个小区的序列所对应的生成多项式的常数项不同，其他项的系数都相同；由所述小区的偏置序列生成对应的时频图案单元，将时频图案单元经过频域等间隔重复，得到完整的时频图案。

Finally it mathematically calculates the CRC at bit and byte level and deducts a 16-bit CRC. The calculation and deduction consolidate the CRC theory. Chapter three also introduces the modulation by two, CRC polynomial, reflection polynomial applied in noise environment and the relationship between reflection polynomial and general polynomial.

第三章首先阐述了循环冗余码与循环码的关系——循环冗余码是一种短循环码、循环冗余码具有所有循环码的很多性质；然后，简单介绍循环冗余码的编码、译码原理和实现；最后，从普通数学的角度，分别用按比特、按字节求解CRC，详细推导了校验码宽度为16的CRC的理论过程，进一步为循环冗余码的研究提供有力的理论基础。

A simple polynomial approach for A Class of nonlinear system modeling is presented. By this, the input-output data are firstly changed into [0, 1] by using topological homeomorphism conversion; then an initial polynomial model is selected. The parameters of polynomial model are estimated by using recursion least squares method. A final polynomial model is obtained by repeatedly estimating parameter and eliminating redundant terms.

给出一类非线性系统的实现简单的多项式逼近的建模方法，在此方法中，将输入输出数据通过拓扑同胚变换，变换到[0，1]区间内，用多项式逼近的方法进行建模，对初始给定的多项式模型，通过反复的参数辨识、去除模型中的冗余项，得到非线性系统的多项式逼近模型，再利用拓扑反变换，将数据还原回原始数据区间。

The shaping method of noncircular part and the tool holder's radial motion characters in noncircular turning process are discussed in detail in the thesis.

论文详细研究了非圆零件的成型方法和加工过程中刀架的径向运动规律。

I have not really liked him,I do not like his this kind of disposition.

我没有真的喜欢他，我不喜欢他的这种性格。