1) Symbolic polynomial
符号多项式
1.
In this paper we deal with the Symbolic computing in the general used of WU s Method and mathematical computing, To save the input Symbolic polynomial, we designed a data structure to show the rational coefficient polynomial.
本文针对吴方法及一些数学计算中需要大量使用的符号计算,设计了一种表示有理系数多项式的数据结构来存储输入的符号多项式。
2) symbolic polynomial manipulations
符号多项式操作
3) Laurent polynomial symbol
Laurent多项式符号
1.
We study minimum-energy frames with compact supports which correspond to some refinable functions with compact supports, and we give a precise existence criterion for minimum-energy frames in terms of an inequality condition on the Laurent polynomial symbols of the refinable functions.
本文研究了对应于紧支撑加细函数的最小能量框架,并得到了最小能量框架存在的准则,该准则是建立在加细函数的Laurent多项式符号上的不等式。
4) Symbolic polynomial algebra
符号多项式代数
5) polynomial symbolic algebra
多项式符号代数
1.
So in this paper,a new algorithm for the equivalence verification of high-level datapaths based on polynomial symbolic algebra is proposed.
由此,以多项式符号代数为理论基础,提出了一个高层次数据通路的等价验证算法。
6) bracket polynomial
括号多项式
1.
Sturmfels and Whiteley proved that for any homogeneous bracket polynomial of length r≥3,there must be a bracket monomial,which made the polynomial be Cayley factored after multiplied it,but they did not give any property of this monomial.
对于任意长度r≥3的齐次括号多项式,一定存在括号单项式,使之Cayley可分解的结论已被证明,然而却没有给出任何有关该单项式的性质,为此通过几个反例证明了这种括号单项式具有即使是次数最低的也不一定是唯一的性质。
补充资料：多项式乘多项式法则
Image:1173836820929048.jpg
多项式乘多项式法则
先用一个多项式的每一项乘以另一个多项式的每一项，再把所得的积相加。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。