Two forms of stationarity prior to criterion in absorbing Markov chains are examined. Both forms require that the probability of a particular response on a particular trial before absorption be independent of trial number. Simple, necessary and sufficient conditions for both forms are developed and applied to several examples. (Author)

A revised theorem is presented concerning uniqueness of minimum rank solutions in common factor analysis. (Author)

Some mathematical aspects of minimum trace factor analysis (MTFA) are discussed. The uniqueness of an optimal point of MTFA is proved, and necessary and sufficient conditions for any particular point to be optimal are given. The connection between MTFA and classical minimum rank factor analysis is discussed. (Author/JKS)

A recursive dynamic programing strategy for reorganizing the rows and columns of square proximity matrices is discussed. The strategy is used when the objective function measuring the adequacy of the reorganization has a fairly simple additive structure. (Author/JKS)

Centering a matrix row-wise and rescaling it column-wise to a unit sum of squares requires an iterative procedure. It is shown that this procedure converges to a stable solution that need not be centered row-wise. The results bear directly on several types of preprocessing methods in Parafac/Candecomp. (Author/TJH)

A modified technique of separable programming was used to maximize the squared correlation ratio of weighted responses to partially ordered categories. The technique employs a polygonal approximation to each single-variable function by choosing mesh points around the initial approximation supplied by Nishisato's method. Numerical examples were…

Peay presented a class of grouping methods based on the concept of the r-clique for symmetric data relationships. The concepts of the r-clique can be generalized readily to directed (or asymmetric) relationships, and groupings based on this generalization may be found conveniently using an adoption of Peay's methodology. (Author/BJG)

Procrustean analysis is a form of factor analysis where a target matrix of results is specified and then approximated. Procrustean analysis is extended here to the case where matrices have different row order. (Author/JKS)

The extent to which one can reduce the rank of a symmetric matrix by only changing its diagonal entries is discussed. Extension of this work to minimum trace factor analysis is presented. (Author/JKS)

A summary and a unified treatment of fully general computational solutions for two criteria for transforming two or more matrices to maximal agreement are provided. The two criteria--Maxdiff and Maxbet--have applications in the rotation of factor loading or configuration matrices to maximal agreement and the canonical correlation problem. (SLD)

The phenomenon of 2 x 2 x 2 arrays having nonmaximal rank with positive probability, pointed out by J. Kruskal (1989), is generalized to 2 x "n" x "n" arrays. It is concluded that a pair of asymmetric square matrices can be diagonalized simultaneously with positive probability. (SLD)

Rowwise matrix correlation, based on the weighted sum of correlations between all pairs of corresponding rows of two proximity matrices, is discussed. Rowwise and columnwise indices are particularly suited for evaluating different types of conjectures of a similar pattern of entries across the two matrices. (SLD)

A multivariate reduced-rank growth curve model is proposed that extends the univariate reduced rank growth curve model to the multivariate case, in which several response variables are measured over multiple time points. The proposed model allows us to investigate the relationships among a number of response variables in a more parsimonious way…

A general model is developed for the analysis of multivariate multilevel data structures. Special cases of this model include: repeated measures designs; multiple matrix samples; multilevel latent variable models; multiple time series and variance and covariance component models. (Author)

The problem of scaling ordinal categorical data observed over two or more sets of categories measuring a single characteristic is addressed. Scaling is obtained by solving a constrained entropy model. A Kullback-Leibler statistic is generated that operationalizes a measure for the strength of consistency among the sets of categories. (TJH)