arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.08437math.ACcs.SC
收藏

利用伪零化多项式求矩阵最小零化多项式的快速算法

Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials

Shinichi Tajima, Katsuyoshi Ohara, Akira Terui

摘要:

极小零化多项式在精确线性代数的许多算法中都是非常有用的。本文提出了一种计算特征为零的域上方阵所有单位向量的最小零化多项式的新方法。该方法的核心思想是伪零化多项式的概念和二进制分裂技术的使用。算法时间复杂度分析表明了算法的有效性。

英文摘要:

Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix over a field of characteristic zero. Key ideas of the proposed method are the concept of pseudo annihilating polynomial and the use of binary splitting technique. Efficiency of the resulting algorithms is shown by arithmetic time complexity analysis.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑