Abstract
A method for computing the transformation matrix for Carroll's analytic simple structure (1) is presented. The procedure involves successively finding the smallest latent root and associated vector of symmetric matrices.
Keywords
Related Publications
Asymptotic Theory for Principal Component Analysis
Abstract : The asymptotic distribution of the characteristic roots and (normalized) vectors of a sample covariance matrix is given when the observations are from a multivariate ...
The Concept of Parsimony in Factor Analysis
The concept of parsimony in factor analysis is discussed. Arguments are advanced to show that this concept bears an analogic relationship to entropy in statistical mechanics and...
The Approximation of One Matrix by Another of Lower Rank
The mathematical problem of approximating one matrix by another of lower rank is closely related to the fundamental postulate of factor-theory. When formulated as a least-square...
Note on Convenient Matrix Notations in Multivariate Statistical Analysis and in the Theory of Linear Aggregation
THE INTRODUCTION of matrix notation and the use of matrix algebra have led to considerable simplifications in the treatment of those fields which are essentially quantitative, l...
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
Publication Info
- Year
- 1956
- Type
- article
- Volume
- 21
- Issue
- 1
- Pages
- 89-92
- Citations
- 7
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1007/bf02289089