Have you tried Golub and Van Loan's Matrix Computations? In the 3/e, it is on p. 418 ff (Section 8.3.5). They call it zero-chasing, but it's the same thing.
I've read about "chasing the bulge" and the implicit QR algorithm, but I > haven't been able to find a description (or implementation/psuedocode) that > I could easily understand. Is there any chance you could point me to an > implementation or pseudocode or a good explanation of the algorithm? Do you > happen to know of an exposition of the implicit QR algorithm that uses > Householder projections rather than Givens rotations? > >
