Recent work by several authors has revealed the existence of many unexpected
classes of normal weighted composition operators. On the other hand, it is
known that every normal operator is a complex symmetric operator. We therefore
undertake the study of complex symmetric weighted composition operators,
identifying several new classes of such operators.
Simulating sample correlation matrices is important in many areas of
statistics. Approaches such as generating normal data and finding their sample
correlation matrix or generating random uniform $[-1,1]$ deviates as pairwise
correlations both have drawbacks. We develop an algorithm for adding noise, in
a highly controlled manner, to general correlation matrices. In many instances,
our method yields results which are superior to those obtained by simply
simulating normal data. Moreover, we demonstrate how our general algorithm can
be tailored to a number of different correlation models.
We prove that the set of all complex symmetric operators on a separable,
infinite-dimensional Hilbert space is not norm closed.
Motivated by a problem of Halmos, we obtain a canonical decomposition for
complex matrices which are unitarily equivalent to their transpose (UET).
Surprisingly, the naive assertion that a matrix is UET if and only if it is
unitarily equivalent to a complex symmetric matrix (i.e., $T = T^t$) holds for
matrices 7x7 and smaller, but fails for matrices 8x8 and larger.