An algorithm for a result on minimal polynomials

DOI10.1016/S0024-3795(02)00302-6MaRDI QIDQ1855423zbMATH OpenFDO

Authors S. D. Agashe

Publication date 5 February 2003

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(02)00302-6

zbMATH Keywords

algorithmlinear transformationminimal polynomial

Mathematics Subject Classification ID

Canonical forms, reductions, classification (15A21)

Review text

For a linear transformation on a finite-dimensional vector space the authors gives an algorithm, involving rational operations only, to obtain a vector whose minimal polynomial is the same as that of the whole space.

Recommendations

• Vectors with a prescribed minimal polynomial
• Computing minimal polynomials of matrices
• On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
• On the computation of the minimal polynomial of a polynomial matrix
• scientific article; zbMATH DE number 563668

Cited in

(11)

• A polynomial-time algorithm for finding zero-sums.
• A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.
• Finding exact minimal polynomial by approximations
• On the minimal polynomial of the associated transformation
• On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix
• scientific article; zbMATH DE number 3946356 (Why is no real title available?)
• A Method to Compute Minimal Polynomials
• scientific article; zbMATH DE number 1765771 (Why is no real title available?)
• scientific article; zbMATH DE number 6319030 (Why is no real title available?)
• Computing unimodular matrices of power transformations
• Polynomials and linear transformations

This page was built for publication: An algorithm for a result on minimal polynomials

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