RANK REDUCIBILITY OF A COVARIANCE MATRIX IN THE FRISCH SCHEME

摘要

The Frisch scheme for identification of mathematical models from data corrupted by additive noise contains many unsolved aspects. One of the principal problems, of particular interest for factor analysis and structural regression methodologies, concerns rank reducibility of a covariance matrix simply by changing its diagonal entries. With reference to this topic, the paper shows that the mathematical models compatible with the data are the solutions of a set of polynomial equations which satisfy some well-defined constraints. The approach is based on the rank reducibility criteria suggested in a well-known paper by Ledermann, generalized to take into account the definiteness conditions on the noise-free covariance matrix. The results obtained give a deeper insight on the theoretical properties of the Frisch scheme and can represent a starting point for the design of numerical algorithms to solve the problem.