On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix

DOI10.2307/2322876MaRDI QIDQ3707255zbMATH OpenOpenAlexFDO

Authors Ronald J. Leach

Publication date 1985

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2322876

zbMATH Keywords

minimal polynomialoperations count

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15)

Recommendations

• Computing minimal polynomials of matrices
• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
• scientific article; zbMATH DE number 1772482
• An algorithm for a result on minimal polynomials
• Computing minimal polynomial of matrices over algebraic extension fields

Cited in

(1)

• Computing minimal polynomials of matrices

This page was built for publication: On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix

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