Unitary equivalence to a complex symmetric matrix: an algorithm (Q2474966)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5245613
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unitary equivalence to a complex symmetric matrix: an algorithm |
scientific article; zbMATH DE number 5245613 |
Statements
Unitary equivalence to a complex symmetric matrix: an algorithm (English)
0 references
6 March 2008
0 references
The author presents a necessary and sufficient condition for almost every \(n\times n\) matrix to be unitarily equivalent to a symmetric matrix with complex entries. For the case \(n=3\), author develops an algorithm for determining whether or not a given \(3\times 3\) matrix is unitarily equivalent to a complex symmetric matrix. This test is constructive in that it explicitly exhibits the unitary equivalence to a complex symmetric matrix.
0 references
unitary equivalence
0 references
complex symmetric matrix
0 references
algorithm
0 references
0.8686082363128662
0 references
0.8685348033905029
0 references
0.8509684801101685
0 references
0.8424808382987976
0 references
0.7940230369567871
0 references
