A QR algorithm with variable iteration multiplicity

I reconsider some hypotheses concerning errant behaviors of the m-tuple QP iteration for real Hessenberg matrices, including potential effects of small products of codiagonal elements on bulge and shift vectors, and the fitness of Householder matrices as information carriers. The design of an iteration with dynamic adjustment of m follows. Results of numerical experiments are included for illustration.