论文信息 - On two-sided orthogonal procrustes problems

On two-sided orthogonal procrustes problems

A least squares method for approximating a given symmetric matrixB by another matrixB which is orthogonally similar to a second given matrixA is derived and then generalized to nonsymmetric (but square)A andB. A possible application to ordering problems is discussed.

P. Schönemann | Peter H. Schönemann

[1] C. Eckart,et al. The approximation of one matrix by another of lower rank , 1936 .

[2] Alston S. Householder,et al. Matrix Approximation and Latent Roots , 1938 .

[3] P. S. Dwyer,et al. Symbolic Matrix Derivatives , 1948 .

[4] L. Tucker. A METHOD FOR SYNTHESIS OF FACTOR ANALYSIS STUDIES , 1951 .

[5] B. Green. THE ORTHOGONAL APPROXIMATION OF AN OBLIQUE STRUCTURE IN FACTOR ANALYSIS , 1952 .

[6] C. Coombs. A theory of data. , 1965, Psychology Review.

[7] Richard Bellman,et al. Introduction to Matrix Analysis , 1972 .

[8] R. Bellman. Introduction To Matrix Analysis By Richard Bellman, New York, 1960 , 1960 .

[9] H. Kaiser. Scaling a simplex , 1962 .

[10] R. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance function. II , 1962 .

[11] J. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[12] M. Greenberg. A method of successive cumulations for the scaling of pair-comparison preference judgments , 1965, Psychometrika.

[13] P. Schönemann,et al. A generalized solution of the orthogonal procrustes problem , 1966 .

[14] B. Mukherjee. Derivation of likelihood-ratio tests for Guttman quasi-simplex covariance structures , 1966 .