Communication avoiding algorithms for dense LU and QR factorizations

We present algorithms for dense LU and QR factorizations that minimize the cost of communication. One of today's challenging technology trends is the increased communication cost. This trend predicts that arithmetic will continue to improve exponentially faster than bandwidth, and bandwidth exponentially faster than latency. The new algorithms for dense QR and LU factorizations greatly reduce the amount of time spent communicating, relative to conventional algorithms.

This is joint work with James Demmel, Mark Hoemmen, Julien Langou, and Hua Xiang.