Deterministic computation of the Frobenius form
暂无分享,去创建一个
[1] A. Storjohann. Algorithms for matrix canonical forms , 2000 .
[2] Walter Keller-Gehrig,et al. Fast Algorithms for the Characteristic Polynomial , 1985, Theor. Comput. Sci..
[3] Mark Giesbrecht. Fast algorithms for matrix normal forms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[4] Gilles Villard,et al. Fast Parallel Algorithms for Matrix Reduction to Normal Forms , 1997, Applicable Algebra in Engineering, Communication and Computing.
[5] Wayne Eberly,et al. Black box Frobenius decompositions over small fields , 2000, ISSAC.
[6] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.
[7] Mark Giesbrecht,et al. Nearly Optimal Algorithms for Canonical Matrix Forms , 1995, SIAM J. Comput..
[8] A. Storjohann. Computing Hermite and Smith normal forms of triangular integer matrices , 1998 .
[9] Patrick Ozello,et al. Calcul exact des formes de Jordan et de Frobenius d'une matrice. (Exact computation of the Jordan and Frobenius forms of a matrix) , 1987 .
[10] Frank Lübeck,et al. On the Computation of Elementary Divisors of Integer Matrices , 2002, J. Symb. Comput..
[11] Arne Storjohann,et al. An O(n3) algorithm for the Frobenius normal form , 1998, ISSAC '98.
[12] Allan K. Steel,et al. Algorithm for the Computation of Canonical Forms of Matrices over Fields , 1997, J. Symb. Comput..
[13] Erich Kaltofen,et al. Parallel algorithms for matrix normal forms , 1990 .
[14] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[15] Heinz Lüneburg,et al. On the rational normal form of endomorphisms : a primer to constructive algebra , 1987 .