COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME

DOI10.1142/S0129054194000165MaRDI QIDQ4853329zbMATH OpenOpenAlexFDO

Authors Jin-Yi Cai

Publication date 29 October 1995

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054194000165

zbMATH Keywords

algebraic extension fieldJordan normal formpolynomial time algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1256647
• Computing rational forms of integer matrices
• scientific article; zbMATH DE number 4096686
• Fast parallel algorithms for matrix reduction to normal forms
• Determining the structure of the Jordan normal form of a matrix by symbolic computation

Cited in

(16)

• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
• scientific article; zbMATH DE number 4096686 (Why is no real title available?)
• Continuous-time orbit problems are decidable in polynomial-time
• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
• Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
• The Complexity of Diagonalization
• Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
• Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
• Bit complexity of Jordan normal form and polynomial spectral factorization
• Quantum temporal logic and reachability problems of matrix semigroups
• Reachability in dynamical systems with rounding
• Linear dynamical systems with weight functions
• Nonnegativity problems for matrix semigroups
• Linear dynamical systems with continuous weight functions
• Targeting completeness: automated complexity analysis of integer programs
• Counting and generating permutations in regular classes

This page was built for publication: COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4853329)