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.
Speaker
William McLean
Research Area
Computational Mathematics
Affiliation
UNSW, Sydney.
Date
Tue, 2/May/2023 - 10:00 a.m.
Venue
RC-4082 and online (passcode: 112358)