On the convergence of the $QR$ algorithm with multishifts

A unified treatment of the cases of quadratic and cubic convergence of the $QR$ algorithm with multishifts is provided. The approach used is similar to that of Elsner and Watkins but does not use the notion of the distance between subspaces. Bibliography: 10 titles.