Improving the performance of reduction to Hessenberg form

Authors:
Gregorio Quintana-Ortí;Robert van de Geijn
Affiliations:
Universidad Jaume I, Castellón, Spain;The University of Texas at Austin, Austin, TX
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2006

Citing 13
Cited 3

An extended set of FORTRAN basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Implementation of the GMRES method using householder transformations

SIAM Journal on Scientific and Statistical Computing - Telecommunication Programs at U.S. Universities
The algebraic eigenvalue problem

The algebraic eigenvalue problem
A storage-efficient WY representation for products of householder transformations

SIAM Journal on Scientific and Statistical Computing
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Modification of the householder method based on the compact WY representation

SIAM Journal on Scientific and Statistical Computing
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Unitary Triangularization of a Nonsymmetric Matrix

Journal of the ACM (JACM)
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)
Solution of the matrix equation AX + XB = C [F4]

Communications of the ACM
The science of deriving dense linear algebra algorithms

ACM Transactions on Mathematical Software (TOMS)
Representing linear algebra algorithms in code: the FLAME application program interfaces

ACM Transactions on Mathematical Software (TOMS)
Accumulating Householder transformations, revisited

ACM Transactions on Mathematical Software (TOMS)

Block variants of Hammarling's method for solving Lyapunov equations

ACM Transactions on Mathematical Software (TOMS)
Parallel two-stage reduction to Hessenberg form using dynamic scheduling on shared-memory architectures

Parallel Computing
Families of Algorithms for Reducing a Matrix to Condensed Form

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, a modification of the blocked algorithm for reduction to Hessenberg form is presented that improves performance by shifting more computation from less efficient matrix-vector operations to highly efficient matrix-matrix operations. Significant performance improvements are reported relative to the performance achieved by the current LAPACK implementation.