A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition (Q1284142)

A number of methods are known in the literature to calculate the QR decomposition of a matrix. The authors start with the basic Givens algorithm and construct a dependency graph such that any valid ordering through that graph yields an algorithm which is numerically identical to the original. Then they develop parametrized orderings through the graph, motivated by a simple model of a superscalar processor with a cache, registers, and a pipeline. The final algorithm simultaneously minimizes the number of loads and stores, while not stalling the floating point pipeline.