activity
20072025
most citedHigh-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

48 citations · 84 across the 7 of their papers we have counts for

collaborators

7 papers

cond-mat.mtrl-sci2025★ 8 cited

Roadmap on Advancements of the FHI-aims Software Package

Joseph W. Abbott, Carlos Mera Acosta, Alaa Akkoush +203

Electronic-structure theory is the foundation of the description of materials including multiscale modeling of their properties and functions. Obviously, without sufficient accurac…

math.NA2020

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…

math.NA2020

On the equivalence of the Hermitian eigenvalue problem and hypergraph edge elimination

Karsten Kahl, Bruno Lang

It is customary to identify sparse matrices with the corresponding adjacency or incidence graph. For the solution of linear systems of equations using Gaussian elimination, the rep…

physics.comp-ph2018★ 1 cited

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…

math.NA2015★ 48 cited

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…

math.NA2012

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…