Computing Eigenvalues

Abstract

This will be an expository talk describing the now classical algorithm for computing the eigenvalues of a dense, real, square matrix. I will discuss subspace iteration, shifts, reduction to upper Hessenberg form, and the implicit QR iteration developed independently by John Francis and Vera
Kublanovskaya in 1961.