An efficient Jordan basis algorithm
From MaRDI portal
This paper puts together an algorithm to compute a Jordan basis. It does so by following textbook methods and assembling them in the right order.
Recommendations
Cites work
- A symmetrization of the Jordan canonical form
- Algorithm for computing Jordan basis
- An extremal sparsity property of the Jordan canonical form
- Determinant of a matrix that commutes with a Jordan matrix
- Determining the structure of the Jordan normal form of a matrix by symbolic computation
- Eigenschemes and the Jordan canonical form
- Eine Anwendung der Jordanschen Normalform
- Explicit Jordan form for certain block triangular matrices
- Extensions of Jordan bases for invariant subspaces of a matrix
- scientific article; zbMATH DE number 2171469 (Why is no real title available?)
- Jordan forms for mutually annihilating nilpotent pairs
- On the change of the Jordan form under the transition from the adjacency matrix of a vertex-transitive digraph to its principal submatrix of co-order one
- On the Jordan form of a family of linear mappings
- The Jordan canonical form for a class of weighted directed graphs
- The Jordan canonical form for a class of zero-one matrices
Cited in
(3)
This page was built for publication: An efficient Jordan basis algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231301)