2018年1月26日
Fast Algorithm for Calculating the Minimal Annihilating Polynomials of Matrices via Pseudo Annihilating Polynomials
- ,
- ,
- 記述言語
- 掲載種別
- 機関テクニカルレポート,技術報告書,プレプリント等
Minimal annihilating polynomials are very useful in a wide variety of<br />
algorithms in exact linear algebra. A new efficient method is proposed for<br />
calculating the minimal annihilating polynomials for all the unit vectors, for<br />
a square matrix over a field of characteristic zero. Key ideas of the proposed<br />
method are the concept of pseudo annihilating polynomial and the use of binary<br />
splitting technique. Efficiency of the resulting algorithms is shown by<br />
arithmetic time complexity analysis.
algorithms in exact linear algebra. A new efficient method is proposed for<br />
calculating the minimal annihilating polynomials for all the unit vectors, for<br />
a square matrix over a field of characteristic zero. Key ideas of the proposed<br />
method are the concept of pseudo annihilating polynomial and the use of binary<br />
splitting technique. Efficiency of the resulting algorithms is shown by<br />
arithmetic time complexity analysis.
- ID情報
-
- arXiv ID : arXiv:1801.08437