High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations

  title={High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations},
  author={A. Pieper and M. Kreutzer and A. Alvermann and Martin Galgon and H. Fehske and Georg Hager and B. Lang and G. Wellein},
  • A. Pieper, M. Kreutzer, +5 authors G. Wellein
  • Published 2016
  • Mathematics, Physics, Computer Science
  • ArXiv
  • 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 projection onto the target space of wanted eigenvectors is approximated with filter polynomials obtained from Chebyshev expansions of window functions. After the discussion of the conceptual foundations of Chebyshev filter diagonalization we analyze the impact of the choice of the damping kernel, search space size, and… CONTINUE READING
    26 Citations
    ChASE: Chebyshev Accelerated Subspace iteration Eigensolver for sequences of Hermitian eigenvalue problems
    • 6
    • PDF
    Chebyshev Filter Diagonalization on Modern Manycore Processors and GPGPUs
    • 12
    • PDF
    Limited-memory polynomial methods for large-scale matrix functions
    • 3
    • PDF
    Implementation and Performance Engineering of the Kaczmarz Method for Parallel Systems
    • PDF
    iVI: An iterative vector interaction method for large eigenvalue problems
    • 11


    On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
    • 63
    • PDF
    Self-consistent-field calculations using Chebyshev-filtered subspace iteration
    • 127
    • PDF
    Increasing the Performance of the Jacobi-Davidson Method by Blocking
    • 28
    • PDF
    Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems
    • 241
    • PDF
    Adaptive choice of projectors in projection based eigensolvers
    • 4
    Harmonic inversion of time signals and its applications
    • 433
    Dissecting the FEAST algorithm for generalized eigenproblems
    • 34
    • PDF