Learn More

We present an efficient implementation of the multi-shift QR algorithm for computing the eigenvalues of a unitary matrix. The algorithm can perform QR iterations of arbitrary degree, it is conceptually simple, and it is backward stable. 1. Introduction. We consider the eigenvalue problem for a unitary matrix U ∈ C n×n that is upper Hessenberg, i.e. u ij = 0… (More)

- ‹
- 1
- ›