Slides from selected talks by David S. Watkins

• The reduction to Hamiltonian Schur form explained, Boston, Amsterdam, Duesseldorf, July 2006.
• Structure-preserving Krylov subspace methods for Hamiltonian and symplectic eigenvalue problems,
  Bedlewo, Poland, March 2007.
• The implicit QZ algorithm for the palindromic eigenvalue problem, Luminy, France, October 2007.
• Understanding the QR algorithm, Part IX , WCLAM, Winnipeg, Manitoba, Canada, May 2008.
• Dealing with Hamiltonian structure: challenges and successes, Structured Linear Algebra Problems: Analysis, Algorithms, and Applications, Cortona, Italy, September 2008.
• Krylov subspace methods for eigenvalue problems, Washington State University Mathematics Colloquium, October 2008. (talk for general mathematical audience)
• Recent progress in the solution of the Hamiltonian eigenvalue problem, Seminar talk, Universite du Littoral, Calais, France, May 2009.
• Understanding the QR algorithm, Part X , 23rd Biennial Conference on Numerical Analysis, University of Strathclyde, Glasgow, Scotland, June 2009.
• Francis's algorithm, ILAS Conference, Pisa, Italy, and IWASEP 8, Berlin, Germany, June 2010. (Look further down on this list for a newer version of this talk.)
• ... generalizing Francis's ... algorithm, Householder Symposium XVIII, Tahoe City, CA, June 2011 and ILAS Conference, Braunschweig, Germany, August 2011.
• Fast computation of the zeros of a polynomial , SIAG LA, Valencia, Spain, June 2012.
• What's so great about Krylov subspaces?, NLAA 2013, IIT Guwahati, India, January 2013.
• Fast computation of eigenvalues of companion, comrade, and related matrices, Luminy, France, October 2012 and ILAS Conference, Providence, RI, June 2013.
• Francis's algorithm, Courant institute, New York University, September 2013, and Purdue University, November 2013.
• Fast stable computation of the eigenvalues of companion matrices, Householder Symposium, Spa, Belgium, June 2014.
• Krylov subspaces and dense eigenvalue problems, SIAM Annual Meeting, Chicago, July 2014.
• Fast and backward stable computation of the zeros of polynomials, Conference in Honor of Volker Mehrmann on the Occasion of his 60th Birthday, Berlin, May 2015.
• Core-chasing algorithms for eigenvalue computation, presented in seminars at Koc University, WSU, Temple University, and New York University, Fall 2015.
• Core-chasing algorithms for the eigenvalue problem, ILAS16, KU Leuven, Belgium, July 2016.
• Francis's algorithm as a core-chasing algorithm, Pacific Northwest Numerical Analysis Seminar, WSU Tri- Cities, October 2016.
• Powers and more powers, Colloquium talk in the Department of Mathematics of the University of Calgary, March 2017.
• Fast stable computation of the eigenvalues of unitary-plus-rank-one matrices, including companion matrices, AMS Sectional Meeting, Washington State University, April 2017.
• Core-Chasing algorithms for the eigenvalue problem, Householder Symposium XX, Virginia Tech, June 2017.
• Fast and backward stable computation of roots of polynomials, WCLAM, Banff, and SIAM Annual Meeting, Pittsburgh, July 2017.
• Solving the matrix eigenvalue problem: chasing bulges, cores, or poles, SIAM Pacific Northwest Section, Seattle University, October 2019.