NASCA 2018

Title slide


In this talk we introduce a rational QZ method for the dense, unsymmetric, generalized eigenvalue problem. The method operates on matrix pairs in Hessenberg form and implicitly performs nested subspace iteration driven by elementary rational functions. This is achieved without solving any systems. We review a direct reduction method to Hessenberg form and demonstrate that subspaces can be deflated already during the reduction phase. We introduce a shifted implicit rational QZ step on a Hessenberg pair. Numerical experiments demonstrate that a good choice of poles can significantly speedup the convergence compared to the QZ method.

Jul 3, 2018 12:00 PM
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.