Key points are not available for this paper at this time.
A least squares method for approximating a given symmetric matrix B by another matrix B which is orthogonally similar to a second given matrix A is derived and then generalized to nonsymmetric (but square) A and B . A possible application to ordering problems is discussed.
Peter H. Schönemann (Fri,) studied this question.