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

Abstract

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 filter polynomial degree on the computational accuracy and effort, before we describe the necessary steps towards a parallel high-performance implementation. Because Chebyshev filter diagonalization avoids the need for matrix inversion it can deal with matrices and problem sizes that are presently not accessible with rational function methods based on direct or iterative linear solvers. To demonstrate the potential of Chebyshev filter diagonalization for large-scale problems of this kind we include as an example the computation of the $10^2$ innermost eigenpairs of a topological insulator matrix with dimension $10^9$ derived from quantum physics applications.

31 pages, 14 figures, 4 tables. Extended version

References in corpus (5)

• The electronic properties of graphene
• The Kernel Polynomial Method
• A Density Matrix-based Algorithm for Solving Eigenvalue Problems
• The fate of topological-insulator surface states under strong disorder
• Performance Engineering of the Kernel Polynomial Method on Large-Scale CPU-GPU Systems

Cited by in corpus (16)

• Polynomially filtered exact diagonalization approach to many-body localization
• Shift-invert diagonalization of large many-body localizing spin chains
• Stability of many-body localization in Floquet systems
• GHOST: Building blocks for high performance sparse linear algebra on heterogeneous systems
• Understanding HPC Benchmark Performance on Intel Broadwell and Cascade Lake Processors
• Polynomial filter diagonalization of large Floquet unitary operators
• Limited-memory polynomial methods for large-scale matrix functions
• Chebyshev Filter Diagonalization on Modern Manycore Processors and GPGPUs
• The Role of Idle Waves, Desynchronization, and Bottleneck Evasion in the Performance of Parallel Programs
• Desynchronization and Wave Pattern Formation in MPI-Parallel and Hybrid Memory-Bound Programs
• Critical Filaments and Superconductivity in Quasiperiodic Twisted Bilayer Graphene
• From Dyson Models to Many-Body Quantum Chaos
• Multichannel active-space embedding of atomic multiplets in plane-wave DFT/PAW for core-level spectroscopies
• A domain-specific language and matrix-free stencil code for investigating electronic properties of Dirac and topological materials
• Orthogonal layers of parallelism in large-scale eigenvalue computations
• Large deviations in the many-body localization transition: The case of the random-field XXZ chain