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)

The method proposed by Harman and Fukuda to treat the so-called Heywood case in the minres method in factor analysis (i.e., the case where the resulting communalities are greater than one) involves the frequent solution of eigenvalue problems. A simple method to treat this problem is presented. (Author/JKS)

Several algorithms for computing the greatest lower bound to reliability or the constrained minimum-trace communality solution in factor analysis have been developed. The convergence properties of these methods are examined. A uniqueness proof for the desired solution is offered. (Author/JKS)

A new algorithm to obtain the least squares solution in common factor analysis is presented. It is based on the up-and-down Marquadt algorithm developed by the present authors. Experiments in the use of the algorithm under various conditions are discussed. (Author/JKS)

Confirmatory factor analysis is considered from a Bayesian viewpoint, in which prior information concerning parameters is incorporated in the analysis. An interactive algorithm is developed to obtain the Bayesian estimates. A numerical example is presented. (Author/JKS)

Two alternating least squares algorithms are presented for the simultaneous components analysis method of R. E. Millsap and W. Meredith (1988). These methods, one for small data sets and one for large data sets, can indicate whether or not a global optimum for the problem has been attained. (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)

Joint correspondence analysis is a technique for constructing reduced-dimensional representations of pairwise relationships among categorical variables. An alternating least-squares algorithm for conducting joint correspondence analysis is presented that requires fewer iterations than the algorithm previously proposed by M. J. Greenacre. (SLD)

In FACTALS, an alternating least squares algorithm is used to fit the common factor analysis model to multivariate data. A. Mooijaart (1984) demonstrated that the algorithm is based on an erroneous assumption. This paper gives a proper solution for the loss function used in FACTALS. (Author/TJH)

Minimum trace factor analysis has been used to find the greatest lower bound to reliability. This technique, however, fails to be scale free. A solution to the scale problem is proposed through the maximization of the greatest lower bound as the function of weights. (Author/JKS)

A longitudinal factor analysis model that is entirely exploratory is proposed for use with multiple populations. Factorial collapse, period/practice effects, and an invariant and/or stationary factor pattern are allowed. The model is formulated stochastically and implemented via a stage-wise EM algorithm. (TJH)

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…

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)