Accelerating computation of eigenvectors in the dense nonsymmetric eigenvalue problem

Mark Gates, Azzam Haidar, Jack Dongarra

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

In the dense nonsymmetric eigenvalue problem, work has focused on the Hessenberg reduction and QR iteration, using efficient algorithms and fast, Level 3 BLAS. Comparatively, computation of eigenvectors performs poorly, limited to slow, Level 2 BLAS performance with little speedup on multi-core systems. It has thus become a dominant cost in the solution of the eigenvalue problem. To address this, we present improvements for the eigenvector computation to use Level 3 BLAS and parallelize the triangular solves, achieving good parallel scaling and accelerating the overall eigenvalue problem more than three-fold.

Original languageEnglish
Title of host publicationHigh Performance Computing for Computational Science - VECPAR 2014 - 11th International Conference, Revised Selected Papers
EditorsOsni Marques, Michel Dayde, Kengo Nakajima
PublisherSpringer Verlag
Pages182-191
Number of pages10
ISBN (Print)9783319173528
DOIs
StatePublished - 2015
Event11th International Conference on High Performance Computing for Computational Science, VECPAR 2014 - Eugene, United States
Duration: Jun 30 2014Jul 3 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8969
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on High Performance Computing for Computational Science, VECPAR 2014
Country/TerritoryUnited States
CityEugene
Period06/30/1407/3/14

Funding

The results were obtained in part with the financial support of the Russian Scientific Fund, Agreement N14-11-00190; the National Science Foundation, U.S. Department of Energy, Intel, NVIDIA, and AMD.

Fingerprint

Dive into the research topics of 'Accelerating computation of eigenvectors in the dense nonsymmetric eigenvalue problem'. Together they form a unique fingerprint.

Cite this