Squeezing the most out of eigenvalue solvers on high-performance computers

Jack J. Dongarra, Linda Kaufman, Sven Hammarling

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

This paper describes modifications to many of the standard algorithms used in computing eigenvalues and eigenvectors of matrices. These modifications can dramatically increase the performance of the underlying software on high-performance computers without resorting to assembler language, without significantly influencing the floating-point operation count, and without affecting the roundoff-error properties of the algorithms. The techniques are applied to a wide variety of algorithms and are beneficial in various architectural settings.

Original languageEnglish
Pages (from-to)113-136
Number of pages24
JournalLinear Algebra and Its Applications
Volume77
Issue numberC
DOIs
StatePublished - May 1986
Externally publishedYes

Funding

*Work supported in part by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109Eng.38.

FundersFunder number
Office of Energy Research
U.S. Department of EnergyW-31-109Eng.38

    Fingerprint

    Dive into the research topics of 'Squeezing the most out of eigenvalue solvers on high-performance computers'. Together they form a unique fingerprint.

    Cite this