Pages that link to "Item:Q1908896"
From MaRDI portal
The following pages link to Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard (Q1908896):
Displaying 4 items.
- Strong NP-completeness of a matrix similarity problem (Q671534) (← links)
- On sensitivity of eigenvalues and eigendecompositions of matrices (Q1763838) (← links)
- The numerical Jordan form (Q2074949) (← links)
- Comparison of K-spectral set bounds on norms of functions of a matrix or operator (Q6541327) (← links)