An Algorithm for Implementing Fisher's Tests
实施 Fisher 迭代检验的算法
THE ALGORITHM DESCRIBED here is used to generate all simultaneous submodels of an econometric model. F. M. Fisher's correspondence principle [1] for simultaneous equation models requires that all simultaneous submodels of the full model be solvable by a particular form of simple iteration, and suggests that the smallest simultaneous submodels be tested first. This algorithm does that by using the primitive v cycle (hereafter called seed) description of a simultaneous…