A Householder-based algorithm for Hessenberg-triangular reduction
Zvonimir Bujanovi\'c, Lars Karlsson, Daniel Kressner

TL;DR
This paper introduces a Householder-based algorithm for Hessenberg-triangular reduction that aims to improve computational efficiency and scalability over traditional Givens rotation methods, with promising initial experimental results.
Contribution
The paper presents a novel Householder reflector-based approach for HT reduction, differing from the Givens rotation method, and discusses its potential for better parallel scalability.
Findings
The new algorithm is competitive in sequential settings despite more floating point operations.
Early experiments suggest improved parallel scalability with multi-threaded BLAS.
The approach may lead to more efficient eigenvalue computations for matrix pencils.
Abstract
The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current method of choice for HT reduction relies entirely on Givens rotations regrouped and accumulated into small dense matrices which are subsequently applied using matrix multiplication routines. A non-vanishing fraction of the total flop count must nevertheless still be performed as sequences of overlapping Givens rotations alternately applied from the left and from the right. The many data dependencies associated with this computational pattern leads to inefficient use of the processor and poor scalability. In this paper, we therefore introduce a fundamentally different approach that relies entirely on (large) Householder reflectors partially accumulated into block reflectors, by using (compact) WY…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
