Now showing items 1-1 of 1
Improving data locality of the nonsymmetric QR algorithm
The QR algorithm computes the Schur decomposition of a matrix and is the most popular algorithm for solving eigenvalue problems for dense nonsymmetric matrices. The algorithm suffers from a memory access bottleneck though. ...