Pole swapping methods for the eigenvalue problem - Rational QR algorithms

Title slide

Abstract

We present a multishift, multipole rational QZ iteration for block Hessenberg pencils in this talk. We show that its convergence behavior is governed by rational functions. The aggressive early deflation strategy is incorporated in the algorithm and we pay special attention to the numerical stability of the pole swaps. Numerical experiments exemplify the competitiveness and accuracy of the resulting methods. This is joint work with Raf Vandebril and Karl Meerbergen.

Date
Jul 16, 2019 11:30 AM
Location
ICIAM 2019 - Valencia, Spain
Valencia,
Daan Camps
Daan Camps
Researcher in Advanced Technologies Group

My research interests include quantum algorithms, numerical linear algebra, tensor factorization methods and machine learning. I’m particularly interested in studying the interface between HPC and quantum computing.

Related