The residual variance is often used as an approximation to the uniqueness in factor analysis. An upper bound approximation to the residual variance is presented for the case when the correlation matrix is singular. (Author/JKS)

A generalized matrix procedure is developed for computing the proportionate contribution of a factor, either orthogonal or oblique, to the total common variance of a factor solution. (Author)

An iterative process is proposed for obtaining an orthogonal simple structure solution. At each iteration, a target matrix is constructed such that the relative contributions of the target majorize the original ones, factor by factor. The convergence of the procedure is proven, and the algorithm is illustrated. (SLD)

A class of oblique rotation procedures is proposed to rotate a pattern matrix so that it optimally resembles a matrix that has an exact simple pattern. It is demonstrated that the method can recover relatively complex simple structures where other simple structure rotation techniques fail. (SLD)

Two Statistical Analysis System (SAS) macros are presented that perform the modified principal components approach of L. R. Tucker (1966) to modeling generalized learning curves analysis up to a rotation of the components. Three SAS macros are described that rotate the factor patterns to have characteristics Tucker considered desirable. (SLD)

The DEDICOM (decomposition into directional components) model provides a framework for analyzing square but asymmetric matrices of directional relationships among "n" objects or persons in terms of a small number of components. One version of DEDICOM ignores the diagonal entries of the matrices. A straightforward computational solution…

The details of EM algorithms for maximum likelihood factor analysis are presented for both the exploratory and confirmatory models. An example is presented to demonstrate potential problems in other approaches to maximum likelihood factor analysis. (Author/JKS)

Gradient methods are employed in orthogonal oblique analytic rotation. Constraints are imposed on the elements of the transformation matrix by means of reparameterisations. (Author)

R. A. Bailey and J. C. Gower explored approximating a symmetric matrix "B" by another, "C," in the least squares sense when the squared discrepancies for diagonal elements receive specific nonunit weights. A solution is proposed where "C" is constrained to be positive semidefinite and of a fixed rank. (SLD)

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)

Beginning with the results of Girschick on the asymptotic distribution of principal component loadings and those of Lawley on the distribution of unrotated maximum likelihood factor loadings, the asymptotic distributions of the corresponding analytically rotated loadings is obtained. The principal difficulty is the fact that the transformation…