solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看11274次
Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials. (arXiv:1801.08437v1 [math.AC])
来源于:arXiv
We propose a efficient method to calculate "the minimal annihilating
polynomials" for all the unit vectors, of square matrix over the integers or
the rational numbers. The minimal annihilating polynomials are useful for
improvement of efficiency in wide variety of algorithms in exact linear
algebra. We propose an efficient algorithm for calculating the minimal
annihilating polynomials for all the unit vectors via pseudo annihilating
polynomials with the key idea of binary splitting technique. Efficiency of the
proposed algorithm is shown by arithmetic time complexity analysis. 查看全文>>