Björn Adlerborn

Learn More
The QZ algorithm reduces a regular matrix pair to generalized Schur form, which can be used to address the generalized eigenvalue problem. This paper summarizes recent work on improving the performance of the QZ algorithm on serial machines and work in progress on a novel parallel implementation. In both cases, the QZ iterations are based on chasing chains(More)
A parallel two-stage ScaLAPACK-style algorithm for reduction of a regular matrix pair (A; B) to Hessenberg-triangular form is presented. Stage one reduces the matrix pair to (Hr; T) form where Hr is upper r-Hessenberg with r subdiagonals and T is upper triangular. In the second stage of the reduction algorithm all but one of the subdi-agonals of the upper(More)
Appearing frequently in applications, generalized eigenvalue problems represent one of the core problems in numerical linear algebra. The QZ algorithm by Moler and Stewart is the most widely used algorithm for addressing such problems. Despite its importance, little attention has been paid to the parallelization of the QZ algorithm. The purpose of this work(More)
  • 1