48 citations · 72 across the 5 of their papers we have counts for
5 papers
Flexible subspace iteration with moments for an effective contour integration-based eigensolver
Sarah Huber, Yasunori Futamura, Martin Galgon +3
Contour integration schemes are a valuable tool for the solution of difficult interior eigenvalue problems. However, the solution of many large linear systems with multiple right h…
Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects
Andreas Alvermann, Achim Basermann, Hans-Joachim Bungartz +30
We first briefly report on the status and recent achievements of the ELPA-AEO (Eigenvalue Solvers for Petaflop Applications - Algorithmic Extensions and Optimizations) and ESSEX II…
High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations
Andreas Pieper, Moritz Kreutzer, Andreas Alvermann +5
We study Chebyshev filter diagonalization as a tool for the computation of many interior eigenvalues of very large sparse symmetric matrices. In this technique the subspace project…
GHOST: Building blocks for high performance sparse linear algebra on heterogeneous systems
Moritz Kreutzer, Jonas Thies, Melven Röhrig-Zöllner +7
While many of the architectural details of future exascale-class high performance computer systems are still a matter of intense research, there appears to be a general consensus t…
Dissecting the FEAST algorithm for generalized eigenproblems
Lukas Krämer, Edoardo Di Napoli, Martin Galgon +2
We analyze the FEAST method for computing selected eigenvalues and eigenvectors of large sparse matrix pencils. After establishing the close connection between FEAST and the well-k…