它在各种各样的计算机系统上运行，尤其擅长于涉及任意长度整数和小数、图、矩阵和多项式代数的算术。
It runs on a variety of computer systems and is especially good at arithmetic involving arbitrary-length integers and fractions, graphics, and matrix and polynomial algebra.
研究了友阵的性质，论述了用相似变换计算矩阵特征多项式的方法。
The property of companion matrix is studied, and the method of calculating the characteristic polynomial of matrix with similar transformation is explained.
结合多项式方法和QR方法各自的特点，提出了一种计算矩阵重特征值的方法。
There are two kinds of method to calculate the eigenvalues of a matrix: characteristic polynomial method and QR method.
为克服数据库因果关系条件概率矩阵维数灾，将因果关系转化为线性多项式，可使计算简便。
To overcome dimension curse of conditional probability matrix, casual rules in databases is converted to linear polynomial, which makes calculation simple.
最后，我们给出了一种计算多项式矩阵最小多项式或特征多项式的有效算法，它从低次项到高次项逐项确定最小多项式的系数多项式。
Finally, we present an efficient algorithm for computing the minimal polynomial of a polynomial matrix. It determines the coefficient polynomials term by term from lower to higher degree.
本文给出了有限域上多项式的友矩阵的某些性质，及其在计算线性移位寄存器序列的周期和循环码的最小长度的应用。
This paper gives some properties of companion matrix of polynomial over finite field with its application for evaluating period of linear shift register sequence and minimal length of cyclic code.
分别给出计算矩阵的最小多项式和向量关于矩阵的最小多项式的初等变换方法。
A method using elementary transformation for calculating minimum polynomials of matrices and vectors are given.
详细介绍了用解析解法和数值解法(即矩阵方程的多项式解法)分别求出了基元回路为正方形的“田”字形超导网络在外磁场中的临界温度，结果表明两种计算方法是完全等价的。
The critical temperature of superconducting network which is composed of square unit loops in external magnetic field is solved by means of analytic method and numeric method I.
详细介绍了用解析解法和数值解法(即矩阵方程的多项式解法)分别求出了基元回路为正方形的“田”字形超导网络在外磁场中的临界温度，结果表明两种计算方法是完全等价的。
The critical temperature of superconducting network which is composed of square unit loops in external magnetic field is solved by means of analytic method and numeric method I.
应用推荐