Computational Mathematics and Scientific Computing Seminar

Francis's Algorithm

Speaker: David Watkins, Washington State University

Location: Warren Weaver Hall 1302

Date: Sept. 27, 2013, 10 a.m.


John Francis’s implicitly shifted QR algorithm turned the problem of matrix eigenvalue computation from difficult to routine almost overnight some fifty years ago. It was named one of the top ten algorithms of the twentieth century by Dongarra and Sullivan, and it continues to be the most important workhorse for eigensystem computations. This talk, which is partly historical, partly pedagogical, and somewhat opinionated, will describe a novel approach to and a novel way of thinking about this important algorithm. The new approach is highly economical and exposes clearly the connections between Francis's algorithm and other important matrix computation algorithms.