Computing the Frobenius normal form of a sparse matrix
From MaRDI portal
Recommendations
Cited in
(7)- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- From additive flowers to additive automata networks
- Automating algorithm selection: checking for matrix properties that can simplify computations
- Black box Frobenius decompositions over small fields
- scientific article; zbMATH DE number 1262434 (Why is no real title available?)
- Computing the block triangular form of a sparse matrix
- Dynamic normal forms and dynamic characteristic polynomial
This page was built for publication: Computing the Frobenius normal form of a sparse matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702027)