On the oblique Rotation of a Factor Matrix to a Specified Pattern

Abstract
This paper presents a procedure for rotating an arbitrary factor matrix to maximum similarity with a specified factor pattern. The sum of squared distances between specified vectors and rotated vectors in oblique Euclidian space is minimized. An example of the application of the procedure is given.