Families of Algorithms for Reducing a Matrix to Condensed Form

  • Authors:

  • Field G. Van Zee;Robert A. van de Geijn;Gregorio Quintana-Ortí;G. Joseph Elizondo

  • Affiliations:

  • The University of Texas at Austin;The University of Texas at Austin;Universidad Jaume I;The University of Texas at Austin

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a recent paper it was shown how memory traffic can be diminished by reformulating the classic algorithm for reducing a matrix to bidiagonal form, a preprocess when computing the singular values of a dense matrix. The key is a reordering of the computation so that the most memory-intensive operations can be “fused.” In this article, we show that other operations that reduce matrices to condensed form (reduction to upper Hessenberg form and reduction to tridiagonal form) can be similarly reorganized, yielding different sets of operations that can be fused. By developing the algorithms with a common framework and notation, we facilitate the comparing and contrasting of the different algorithms and opportunities for optimization on sequential architectures. We discuss the algorithms, develop a simple model to estimate the speedup potential from fusing, and showcase performance improvements consistent with the what the model predicts.