Affordable Access

Increasing Data Reuse in the Unsymmetric QR Algorithm

Cornell University
Publication Date
  • Theory Center
  • Computer Science


This paper models data use in the Unsymmetric QR Eigenvalue Algorithm to improve performance on machines with memory hierarchy. Most of the algorithms and strategies presented can be implemented so that they are numerically similar to strategies found in such libraries as LAPACK and EISPACK ([1,5]). We provide tests to show improvement of performance. Some strategies implemented include the use of block methods, transposing the matrix, reducing the average stride, reducing data movement with hybrid steps, and using block data structures.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

QROCK: A quick version of the ROCK algorithm for c...

on Pattern Recognition Letters Jan 01, 2005

The periodic QR algorithm is a disguised QR algori...

on Linear Algebra and its Applica... Jan 01, 2006
More articles like this..