Computing the generic jordan canonical form

DOI10.1080/03081089108818048zbMath0716.65038OpenAlexW1969086058MaRDI QIDQ3203922

Miloš Schlegel, Svatopluk Poljak

Publication date: 1991

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089108818048

zbMATH Keywords

sparse matricescomplexity reductionJordan blocksgraph-theoretical approach\(O(n^ 4\log \,n)\) time algorithmgeneric Jordan canonical formzero/nonzero pattern of the matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Systems analysis by graphs and matroids. Structural solvability and controllability
• Maximum Rank of Powers of a Matrix of a Given Pattern
• The Jordan Canonical Form: An Old Proof
• Degrees of the invariant factors and the rank of principal submatrices of a matrix

This page was built for publication: Computing the generic jordan canonical form