48 citations · 84 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…