| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4600049 | Linear Algebra and its Applications | 2013 | 7 Pages |
Abstract
Let S1, S2, S3, S4 be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in S1 is unitarily similar via U, each pair of matrices in S2 is unitarily congruent via U, each pair of matrices in S3 is unitarily similar via , and each pair of matrices in S4 is unitarily congruent via .
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
