1. Nearly optimal algorithms for canonical matrix forms;Giesbrecht;SIAM J. Comput.,1995
2. W. Eberly, Asymptotically efficient algorithms for the Frobenius form, Paper 723-26, Department of Computer Science, University of Calgary, 2003. URL: http://www.cpsc.ucalgary.ca/~eberly/Publications.
3. Computing the Frobenius normal form of a sparse matrix;Villard,2000
4. A. Storjohann, Deterministic computation of the Frobenius form, in: FOCS, 2001, pp. 368–377.
5. Faster algorithms for the characteristic polynomial;Pernet,2007