Computing minimal polynomial of matrices over algebraic extension fields
From MaRDI portal
Recommendations
- Computing minimal polynomials of matrices
- Gröbner basis for an ideal of a polynomial ring over an algebraic extension over a field and its applications
- Using Gröbner bases for factoring polynomials over algebraic extension fields
- A Method to Compute Minimal Polynomials
- Computing and using minimal polynomials
Cited in
(8)- Gröbner basis for an ideal of a polynomial ring over an algebraic extension over a field and its applications
- Computing and using minimal polynomials
- Minimal height companion matrices for Euclid polynomials
- Computing minimal polynomials of matrices
- Computing minimal polynomials and the degree of unfaithfulness
- On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix
- Minimal polynomial of an algebraic number
- On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
This page was built for publication: Computing minimal polynomial of matrices over algebraic extension fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5412912)