Monotonically convergent algorithms are described for maximizing sums of quotients of quadratic forms. Six (constrained) functions are investigated. The general formulation of the functions and the algorithms allow for application of the algorithms in various situations in multivariate analysis. (SLD)

General algorithms are presented that can be used for optimizing matrix trace functions subject to certain constraints on the parameters. The parameter set that minimizes the majorizing function also decreases the matrix trace function, providing a monotonically convergent algorithm for minimizing the matrix trace function iteratively. (SLD)

A globally optimal solution is presented for a class of functions composed of a linear regression function and a penalty function for the sums of squared regression weights. A completing-the-squares approach is used, rather than calculus, because it yields global minimality easily in two of three cases examined. (SLD)

An algorithm, based on a solution for C. I. Mosier's oblique Procrustes rotation problem, is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. Results are of interest for missing value and tetrachoric correlation, indefinite matrix correlation, and constrained…

An algorithm based on the majorization theory of J. de Leeuw and W. J. Heiser is presented for fitting the slide-vector model. It views the model as a constrained version of the unfolding model. A three-way variant is proposed, and two examples from market structure analysis are presented. (SLD)

An algorithm for obtaining initial values for the minimization process in covariance structure analysis is developed that is more generally applicable for computing parameters connected to latent variables than the currently existing ones. The algorithm is formulated in terms of the RAM model but can be extended. (SLD)

The DEcomposition into DIrectional COMponents (DEDICOM) method for analysis of asymmetric data gives representations that are identified only up to a non-singular transformation. To identify solutions, it is proposed that subspace constraints be imposed on the stimulus coefficients. Procedures are discussed for several cases. (SLD)

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)

The suggestion that the IDIOSCAL model be fitted by the TUCKALS2 algorithm for three-way components analysis is examined. The claim that resulting coordinate matrices will be identical is supported when the data matrices are semidefinite. Counterexamples for indefinite matrices are also constructed. (SLD)

The article discusses the use of computers to teacher college level mathematics. In particular, the Gaussian elimination procedure for solving a system of n linear equations in n unknowns, using a computer, is examined. (PK)

Presented is a method where a quadratic equation is solved and from its roots the eigenvalues and corresponding eigenvectors are determined immediately. Included are the proposition, the procedure, and comments. (KR)