Unitary equivalence to a complex symmetric matrix: an algorithm
Functional Analysis
2009-08-18 v1
Abstract
We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a necessary and sufficient condition that applies to almost every n by n matrix. The test is constructive in that it explicitly exhibits the unitary equivalence to a complex symmetric matrix.
Cite
@article{arxiv.0908.2201,
title = {Unitary equivalence to a complex symmetric matrix: an algorithm},
author = {James E. Tener},
journal= {arXiv preprint arXiv:0908.2201},
year = {2009}
}
Comments
10 pages