A Practical Implementation of Modular Algorithms for Frobenius Normal Forms of Rational Matrices(Algorithm Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• Modular algorithms for computing the Frobenius normal forms of integer and rational matrices are presented and their implementation is reported. These methods compute Frobenius normal forms over Z_<pi>, where p_i's are distinct primes, and then construct, the normal forms over Z or Q by the Chinese remainder theorem. Our implementation includes: (1) detection of unlucky primes, (2) a new formula for the efficient computation of a transformation matrix, and (3) extension of our preceding algorithm over Z to one over Q. Through experiments using a number of test matrices, we confirm that our modular algorithm is more efficient in practical terms than the straightforward implementation of conventional methods.

• 一般社団法人情報処理学会の論文
• 2004-06-15

著者

• Moritsugu Shuichi

  Institute Of Library And Information Science University Of Tsukuba

関連論文

• A Practical Implementation of Modular Algorithms for Frobenius Normal Forms of Rational Matrices(Algorithm Theory)

スポンサーリンク