A Practical Implementation of Modular Algorithms for Frobenius Normal Forms of Rational Matrices

機関リポジトリ 情報処理学会 HANDLE Web Site 被引用文献1件 参考文献32件 オープンアクセス

書誌事項

タイトル別名
  • Practical Implementation of Modular Algorithms for Frobenius Normal Forms of Rational Matrices
  • アルゴリズム理論

この論文をさがす

説明

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 Zpi where pi'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.

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 Zpi, where pi'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.

収録刊行物

被引用文献 (1)*注記

もっと見る

参考文献 (32)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ