Determining the structure of the Jordan normal form of a matrix by symbolic computation

DOI10.1016/0024-3795(95)00669-9zbMath0870.65030OpenAlexW2086574746MaRDI QIDQ676030

Zhinan Zhang, Tian-Jun Wang, Tien-Yien Li

Publication date: 13 March 1997

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

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00669-9

zbMATH Keywords

algorithmnumerical examplesymbolic computationminimal polynomialsJordan normal formsquarefree relatively prime basis

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21)

Related Items (10)

The rank of a random matrix ⋮ The Complexity of Diagonalization ⋮ An efficient Jordan basis algorithm ⋮ Characterisation and representation of non-dissipative electromagnetic medium with two Lorentz null cones ⋮ The numerical rank of a matrix and its applications ⋮ The representation and approximation for Drazin inverse ⋮ Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming ⋮ Unnamed Item ⋮ Perturbation bound of the Drazin inverse ⋮ How many vectors generate maximal cyclic subspaces?

Uses Software

• LAPACK
• Mathematica
• EISPACK

Cites Work

• Parallel algorithms for matrix normal forms
• Matrix eigensystem routines - EISPACK guide. 2nd ed
• Parallel Algorithms for Algebraic Problems
• An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Determining the structure of the Jordan normal form of a matrix by symbolic computation