求首尾和r-循环矩阵的极小多项式的算法

研究了域上首尾和r-循环矩阵，利用多项式环的理想的Groebner基的算法给出了任意域上首尾和r-循环矩阵的极小多项式和公共极小多项式的一种算法.同时给出了这类矩阵逆矩阵的一种求法。     

关于有限域Fq上矩阵阶的研究

详细地研究了有限域Fq上的矩阵的阶的问题，得到了相当理想的结果。并给出一类矩阵方幂的极小多项式的求法。     

关于有限域F_q上矩阵阶的研究

详细地研究了有限域 Fq上的矩阵的阶的问题 ,得到了相当理想的结果 .并给出一类矩阵方幂的极小多项式的求法     

代数数极小多项式的近似重构

给出了代数数极小多项式近似重构的误差控制条件,进而基于同步整数关系探测算法SIRD,得到一个从代数数近似值重构其准确极小多项式的完备的新算法,从而将“采用近似计算获得准确值”这一思想的适用范围从有理数扩展到代数数.     

任意域上多项式的几个性质

本文给出任意域上两个多项式的某线性组合无重因子的两个特征性质 ,并改进了已知结果 .     

循环矩阵与单位根

研究了任意域上多项式f(x)在m(≥degf(x))次单位根群中的零点个数与由f(x)的系数所构成的循环矩阵的秩之间的关系,推广了Knig-Rados定理,得到了f(x)与x~m-1互素的充要条件,并给出了分解f(x)及判定f(x)是否为分圆多项式的方法.     

GMW序列的迹表示

研究了长度为2n-1的二元GMW序列的迹表示,用从F2n到F2的迹函数的和式给出了GMW序列的一种简洁的迹表示,并且通过这种迹表示得到了一种新的快速生成GMW序列的方法和一种求GMW序列的极小多项式的方法.最后,还证明了两个GMW序列具有相同极小多项式的一个充要条件.     

线性子空间上求解矩阵方程组A_1XB_1=C_1,A_2XB_2=C_2的迭代算法

应用共轭梯度方法,结合线性投影算子,给出迭代算法求解了线性矩阵方程组A_1XB_1=C_1,A_2XB_2=C_2在任意线性子空间上的约束解及其最佳逼近.当矩阵方程组A_1XB_1=C_1,A_2XB_2=C_2相容时,可以证明,所给迭代算法经过有限步迭代可得到矩阵方程组的约束解、极小范数解和最佳逼近.文中的数值例子证实了该算法的有效性.     

几类最优五元负循环码的构造

作为循环码的推广,有限域上负循环码具有良好的代数结构.由于其具有高效的编码和译码算法,因而被广泛地应用在数据存储系统、通信系统和密码等领域.文章研究了码长n=(5m-1)/2且具有两个零点βv和βv+2的五元负循环码,其中β是F5m*的生成元且0≤v≤(5m-7)/2,通过分析有限域F5m上方程组解的存在性,给出了这类码具有最优参数[(5m-1)/2,(5m-1)/2-2m,4]的充要条件.在此基础上,利用有限域F5m上多项式唯一分解得到了两类最优五元负循环码.进一步,考虑了具有两个零点βv和βv+2r的五元负循环码,其中gcd(r,2n)=1,给出了这类五元负循环码具有极小距离4的充要条件,并构造了第三类最优五元负循环码.     

关于矩阵多项式特征值界的注记

本文讨论矩阵多项式特征值定域问题.首先对Higham和Tisseur[Linear Algebra Appl.,358(2003),5-22]得到的结果给出较详细的比较.然后利用分块矩阵谱半径的估计给出了获取特征值界的一种新办法.利用这种新办法,不但可以简明地得出很多已有的界,且对椭圆及双曲矩阵多项式得出了特征值的新的界.     

Algorithms for finding the minimal polynomials and inverses of resultant matrices

In this paper, algorithms for computing the minimal polynomial and the common minimal polynomial of resultant matrices over any field are presented by means of the approach for the Gröbner basis of the ideal in the polynomial ring, respectively, and two algorithms for finding the inverses of such matrices are also presented. Finally, an algorithm for the inverse of partitioned matrix with resultant blocks over any field is given, which can be realized by CoCoA 4.0, an algebraic system over the field of rational numbers or the field of residue classes of modulo prime number. We get examples showing the effectiveness of the algorithms.     

Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables

In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full classification of such multivariate skew polynomial rings (free or not) over finite fields. To that end, we first show that all ring morphisms from the field to the ring of square matrices are diagonalizable, and that the corresponding derivations are all inner derivations. Secondly, we show that all such multivariate skew polynomial rings over finite fields are isomorphic as algebras to a multivariate skew polynomial ring whose ring morphism from the field to the ring of square matrices is diagonal, and whose derivation is the zero derivation. Furthermore, we prove that two such representations only differ in a permutation on the field automorphisms appearing in the corresponding diagonal. The algebra isomorphisms are given by affine transformations of variables and preserve evaluations and degrees. In addition, ours proofs show that the simplified form of multivariate skew polynomial rings can be found computationally and explicitly.     

Deterministic computation of the characteristic polynomial in the time of matrix multiplication

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only achieved by resorting to genericity assumptions or randomization techniques, while the best known complexity bound with a general deterministic algorithm was obtained by Keller-Gehrig in 1985 and involves logarithmic factors. Our algorithm computes more generally the determinant of a univariate polynomial matrix in reduced form, and relies on new subroutines for transforming shifted reduced matrices into shifted weak Popov matrices, and shifted weak Popov matrices into shifted Popov matrices.     

体上代数矩阵的素有理标准形与特征值

本文应用最小中心多项式给出了体上代数矩阵的素有理标准形与初等因子组的构造，由此得到体上代数矩阵相似的充要条件以及相似于一个对角矩阵的充要条件．本文还讨论了体上矩阵的左、右特征值的构造与性质．     

Minimal polynomial systems for parametric matrices

In this article, we study the minimal polynomials of parametric matrices. Using the concept of (comprehensive) Gröbner systems for parametric ideals, we introduce the notion of a minimal polynomial system for a parametric matrix, i.e. we decompose the space of parameters into a finite set of cells and for each cell we give the corresponding minimal polynomial of the matrix. We also present an algorithm for computing a minimal polynomial system for a given parametric matrix.     

On the Key Equation Over a Commutative Ring

We define alternant codes over a commutative ring R and a corresponding key equation. We show that when the ring is a domain, e.g. the p-adic integers, the error-locator polynomial is the unique monic minimal polynomial (equivalently, the unique shortest linear recurrence) of the finite sequence of syndromes and that it can be obtained by Algorithm MR of Norton.WhenR is a local ring, we show that the syndrome sequence may have more than one (monic) minimal polynomial, but that all the minimal polynomials coincide modulo the maximal ideal ofR . We characterise the set of minimal polynomials when R is a Hensel ring. We also apply these results to decoding alternant codes over a local ring R: it is enough to find any monic minimal polynomial over R and to find its roots in the residue field. This gives a decoding algorithm for alternant codes over a finite chain ring, which generalizes and improves a method of Interlando et. al. for BCH and Reed-Solomon codes over a Galois ring.     

Critical pairs of matrices for the degree of the minimal polynomial of the Kronecker sum

In [4] Dias da Silva and Hamidoune obtained a lower bound for the degree of the minimal polynomial of the Kronecker sum of two matrices in terms of the degrees of the minimal polynomials of the matrices. We determine the pairs of matrices for which this bound is reached.     

Sparse bivariate polynomial factorization

Motivated by Sasaki’s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is efficient, especially for sparse bivariate polynomials.     

欧拉图与矩阵环的多项式恒等式

本文运用Swan证明Amitsur-levitzki定理所用有向路图论方法，获得了交换环上矩阵环所满足的一类新型多项式恒等式，标准多项式恒等式和Chang-Giambruno-Sehgal多项式恒等式是我们所得恒等式的特例。