Concurrent array processor for fast eigenvalue computations

We present in this paper an algorithm that doubles-np on Francis's QR algorithm. By this we mean that we can obtain the QR iterates at step 1, 2, 4, 8, 16, etc for every sweep over the matrix. We also show that the algorithm can be implemented on a highly regular array of computing elements with only neighborhood communication between processors… (More)