A STABLE RATIONAL IMPLICIT QL SCHEME
一个稳定的有理隐式QL执行格式

A rational algorithm, in which there exists no square root, is more efficient because asquare root costs far more time than arithmetic on a computer. In this paper, the author gets atheoretical result in § 2 and points out a oversight in Prof. B.N. Parlett's famous works in pass-ing. In addition, a series of his conclusions about rational implicit QL algorithm are overth-rown. Meanwhile, a stable rational scheme on this algorithm is designed in § 3. Some nume-xical examples in §4 show that it is successful.