Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is NP-hard - MaRDI portal

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

From MaRDI portal
Publication:1908896

DOI10.1006/jcom.1995.1019zbMath0843.68034OpenAlexW2079989873MaRDI QIDQ1908896

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

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (3)

Strong NP-completeness of a matrix similarity problem ⋮ On sensitivity of eigenvalues and eigendecompositions of matrices ⋮ The numerical Jordan form


Uses Software



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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1908896&oldid=14324014"
Powered by MediaWiki