Computing minimal polynomials of matrices

DOI10.1112/S1461157000000590MaRDI QIDQ3091965zbMATH OpenOpenAlexFDO

Authors 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

finite fieldminimal polynomialMonte-Carlo algorithmnumerical examplesworst-case complexity

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
• On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix
• scientific article; zbMATH DE number 1834664
• scientific article; zbMATH DE number 1256647
• Computing minimal polynomial of matrices over algebraic extension fields

Cites work

• A new algorithm for the computation of canonical forms of matrices over fields
• Fast algorithms for the characteristic polynomial
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Nearly Optimal Algorithms for Canonical Matrix Forms
• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms

Cited in

(22)

• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
• The complexity of the characteristic and the minimal polynomial.
• An algorithm for a result on minimal polynomials
• Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
• Computing and using minimal polynomials
• Minimal height companion matrices for Euclid polynomials
• The RCH method for computing minimal polynomials of polynomial matrices
• Minimal polynomial and reduced rank extrapolation methods are related
• On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix
• A Method to Compute Minimal Polynomials
• scientific article; zbMATH DE number 4127340 (Why is no real title available?)
• scientific article; zbMATH DE number 1834664 (Why is no real title available?)
• A practical model for computation with matrix groups.
• scientific article; zbMATH DE number 2089958 (Why is no real title available?)
• scientific article; zbMATH DE number 913545 (Why is no real title available?)
• Dynamics of linear systems over finite commutative rings
• scientific article; zbMATH DE number 7196252 (Why is no real title available?)
• Faster algorithms for the characteristic polynomial
• Computing minimal polynomial of matrices over algebraic extension fields
• ON THE MINIMAL POLYNOMIAL OF A MATRIX
• On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
• Towards an efficient meat-axe algorithm using f-cyclic matrices: The density of uncyclic matrices in M(n,q)

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Computing minimal polynomials of matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091965)