Asymptotically Efficient Algorithms for the Frobenius Form

A new randomized algorithm is presented for computation of the Frobenius form of an n×n matrix over a field. A version of the algorithm is presented that uses standard arithmetic whose asymptotic expected complexity matches the worst case complexity of the best known deterministic algorithm for this problem, recently given by Storjohann and Villard [25], and that seems to be superior when applied to sparse or structured matrices with a small number of invariant factors. A version that uses asymptotically fast matrix multiplication is also presented. This is the first known algorithm for this computation over small fields whose asymptotic complexity matches that of the best algorithm for computations over large fields and that also provides a Frobenius transition matrix over the ground field. As an application, it is shown that a “rational Jordan form” of an n×n matrix over a finite field can also be computed asymptotically efficiently.

[1]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[2]  Claude Brezinski.  A transpose-free Lanczos/Orthodir algorithm for linear systems , 1997 .

[3]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[4]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[5]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[6]  Daniel Augot,et al.  On the Computation of Minimal Polynomials, Cyclic Vectors, and Frobenius Forms , 1997 .

[7]  I. Blake,et al.  Computational aspects of discrete logarithms , 1996 .

[8]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[9]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[10]  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 .

[11]  Heinz Lüneburg,et al.  On the rational normal form of endomorphisms : a primer to constructive algebra , 1987 .

[12]  Allan K. Steel,et al.  Algorithm for the Computation of Canonical Forms of Matrices over Fields , 1997, J. Symb. Comput..

[13]  James L. Massey,et al.  Step-by-step decoding of the Bose-Chaudhuri- Hocquenghem codes , 1965, IEEE Trans. Inf. Theory.

[14]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[15]  Victor Y. Pan,et al.  Processor efficient parallel solution of linear systems over an abstract field , 1991, SPAA '91.

[16]  G. Villard.  Computing the Frobenius Normal Form of a Sparse Matrix , 2000 .

[17]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[18]  Walter Keller-Gehrig,et al.  Fast Algorithms for the Characteristic Polynomial , 1985, Theor. Comput. Sci..

[19]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[20]  Arne Storjohann,et al.  An O(n3) algorithm for the Frobenius normal form , 1998, ISSAC '98.

[21]  Erich Kaltofen,et al.  Challenges of Symbolic Computation: My Favorite Open Problems , 2000, J. Symb. Comput..

[22]  Mark Giesbrecht,et al.  Nearly Optimal Algorithms for Canonical Matrix Forms , 1995, SIAM J. Comput..

[23]  Erich Kaltofen,et al.  Subquadratic-time factoring of polynomials over finite fields , 1998, Math. Comput..

[24]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[25]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[26]  Allan Borodin,et al.  The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.

[27]  Rudolf Lide,et al.  Finite fields , 1983 .

[28]  David Y. Y. Yun,et al.  Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.