Parallel eigenvalue computation for banded generalized eigenvalue problems

Michael Rippl, Bruno Lang, Thomas Huckle

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We consider generalized eigenvalue problems Ax=Bxλ with a banded symmetric matrix A and a banded symmetric positive definite matrix B. To reduce the generalized eigenvalue problem to standard form Cy=yλ the algorithm proposed by Crawford is applied preserving the banded structure in C. We present a parallel implementation of this method for the ELPA library. Performance analysis shows the capabilities of the approach.

Original languageEnglish
Article number102542
JournalParallel Computing
Volume88
DOIs
StatePublished - Oct 2019

Keywords

  • Banded symmetric positive definite Generalized eigenvalue problem
  • Parallel implementation
  • Reduction to standard eigenvalue problem

Fingerprint

Dive into the research topics of 'Parallel eigenvalue computation for banded generalized eigenvalue problems'. Together they form a unique fingerprint.

Cite this