Conclusions

In this manuscript a multishift implementation of the $QR$-algorithm for Hessenberg-like matrices was developed. The algorithm can be subdivided into two parts: a first part performing $QR$-steps without shift and a second part consisting of the chasing. These two parts create two types of convergence behavior which need to be monitored. The final numerical experiments show that the developed technique is numerically reliable.