Computing Minimal Polynomials of Matrices

DOI10.1112/S1461157000000590zbMath1225.65047OpenAlexW2963045747MaRDI QIDQ3091965

Max Neunhöffer, Cheryl E. Praeger

Publication date: 15 September 2011

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s1461157000000590

zbMATH Keywords

numerical examplesfinite fieldMonte-Carlo algorithmminimal polynomialworst-case complexity

Mathematics Subject Classification ID

Related Items (4)

A practical model for computation with matrix groups. ⋮ Dynamics of linear systems over finite commutative rings ⋮ Towards an efficient meat-axe algorithm using \(f\)-cyclic matrices: The density of uncyclic matrices in M\((n,q)\) ⋮ Unnamed Item

Uses Software

• GAP
• Magma

Cites Work

• Unnamed Item
• Fast algorithms for the characteristic polynomial
• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
• A new algorithm for the computation of canonical forms of matrices over fields
• Nearly Optimal Algorithms for Canonical Matrix Forms

This page was built for publication: Computing Minimal Polynomials of Matrices