Description

Shifted QR is a widely used algorithm for computing an approximate Schur form of a matrix. I will explain the basic ideas around proving global convergence for a certain variant of this algorithm. The key obstructions to convergence are symmetry in the spectrum and transient behavior due to nonnormality.

All scheduled dates:

Upcoming


Whiteboard Talk: Convergence of the Shifted QR Algorithm

Past

No Past activities yet