Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard

DOI10.1006/JCOM.1995.1019MaRDI QIDQ1908896zbMATH OpenOpenAlexFDO

Authors Ming Gu

Publication date 13 August 1996

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL http://www.escholarship.org/uc/item/2x88d28s

zbMATH Keywords

NP-hard

Mathematics Subject Classification ID

Basic linear algebra (15A99) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 741115
• Strong NP-completeness of a matrix similarity problem
• Diagonal matrix scaling is NP-hard

Cited in

(5)

• scientific article; zbMATH DE number 741115 (Why is no real title available?)
• The numerical Jordan form
• On sensitivity of eigenvalues and eigendecompositions of matrices
• Strong NP-completeness of a matrix similarity problem
• Comparison of K-spectral set bounds on norms of functions of a matrix or operator

Describes a project that uses

Uses Software

• HQR3

This page was built for publication: Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard

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