Effective algorithms for decomplexifying a matrix by unitary similarities or congruences (Q1946442)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Effective algorithms for decomplexifying a matrix by unitary similarities or congruences |
scientific article; zbMATH DE number 6153810
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Effective algorithms for decomplexifying a matrix by unitary similarities or congruences |
scientific article; zbMATH DE number 6153810 |
Statements
Effective algorithms for decomplexifying a matrix by unitary similarities or congruences (English)
0 references
15 April 2013
0 references
unitary similarity
0 references
unitary congruence
0 references
irreducible matrix
0 references
polar decomposition
0 references
consimilarity
0 references
algorithm
0 references
0 references
0 references
0.9013297
0 references
0.88463414
0 references
0.88429487
0 references
0.88164175
0 references
0.87198925
0 references
0.8707665
0 references
0.8674294
0 references
