A general factor analysis computer algorithm is briefly discussed. The algorithm is highly transportable with minimum limitations on the number of observations. Both singular and non-singular data can be analyzed. (Author/JKS)

A procedure is outlined showing how the axiom of local independence for latent structure models can be weakened. (CK)

Relations between maximum likelihood factor analysis and factor indeterminacy are discussed. (CK)

Applications to the Promax Rotation are discussed, and it is shown that these procedures solve Thurstone's hitherto intractable "invariant" box problem as well as other more common problems based on real data. (Author/RC)

Procrustes rotation involves fitting a factor pattern matrix to a specified target matrix in factor analysis. These rotations are useful for the investigator who wishes to see how well his data can be made to fit a hypothesized factor pattern matrix. The mathematical problems involved in these transformations are outlined and computer algorithms…

Under some circumstances, it is desirable to compare the factor patterns obtained from different factor analyses. To date, the best method of simultaneously achieving simple structure and maximum similarity is the technique devised by Bloxom (1968). This technique simultaneously rotates different factor patterns to maximum similarity and varimax…