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)

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)

Arguments by J. Levin (1988) challenging the convergence properties of the Harman and Jones (1966) method of Minres factor analysis are shown to be invalid. Claims about the invalidity of a rank-one version of the Harman and Jones method are also refuted. (TJH)

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

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)

A new basic algorithm is discussed that may be used to do factor analysis by any of these three methods: (1) unweighted least squares, (2) generalized least squares, or (3) maximum likelihood. (CK)

The dynamic factor model proposed by P. C. Molenaar (1985) is exhibited, and a dynamic nonstationary factor model (DNFM) is constructed with latent factor series that have time-varying mean functions. The use of a DNFM is illustrated using data from a television viewing habits study. (SLD)

A model permitting construction of algorithms for the polynomial conjoint analysis of similarities is presented. This model, which is based on concepts used in nonmetric scaling, permits one to obtain the best approximate solution. The concepts used to construct nonmetric scaling algorithms are reviewed. Finally, examples of algorithmic models for…

Two algorithms that automatically select subsets of variables (PACE algorithm) and reference variables (Fabin estimators), respectively, used for the noniterative estimators are presented. The PACE algorithm is based on a nonsymmetric matrix sweep operator. A Monte Carlo experiment compares the relative performance of these estimators and others.…

An implementation of the Gauss-Newton algorithm for the analysis of covariance structure that is specifically adapted for high-level computer languages is reviewed. This simple method for estimating structural equation models is useful for a variety of standard models, as is illustrated. (SLD)

Examines the definition of journal coverage overlap in abstracting and indexing services during the past 30 years of research and expands the definition using a matrix of dissimilarity values. Multidimensional scaling analysis is applied to graphically demonstrate this definition and a naive secondary tool selection algorithm is presented. (43…

A method is proposed for constructing a population covariance matrix as the sum of a particular model plus a nonstochastic residual matrix, with the stipulation that the model holds with a prespecified lack of fit. The procedure is considered promising for Monte Carlo studies. (SLD)

A two-level model for factor analysis is defined, and formulas for a scoring algorithm for this model are derived. A simple noniterative method based on decomposition of total sums of the squares and cross-products is discussed and illustrated with simulated data and data from the Second International Mathematics Study. (SLD)

This paper discusses the use of latent class structure as a modelling framework for tests in which much of the data conforms to a relatively small number of systematic patterns. Application of this framework to the analysis of tests has been limited because available parameter estimation algorithms can only handle a relatively small number of…