A Shift Selection Strategy for Parallel Shift-Invert Spectrum Slicing in Symmetric Self-Consistent Eigenvalue Computation

by   David B. Williams-Young, et al.

The central importance of large scale eigenvalue problems in scientific computation necessitates the development massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing excessive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions which will be explored in future work.



There are no comments yet.


page 19


A Parallel Direct Eigensolver for Sequences of Hermitian Eigenvalue Problems with No Tridiagonalization

In this paper, a Parallel Direct Eigensolver for Sequences of Hermitian ...

High Performance Solution of Skew-symmetric Eigenvalue Problems with Applications in Solving the Bethe-Salpeter Eigenvalue Problem

We present a high-performance solver for dense skew-symmetric matrix eig...

A rational Even-IRA algorithm for the solution of T-even polynomial eigenvalue problems

In this work we present a rational Krylov subspace method for solving re...

GCGE: A Package for Solving Large Scale Eigenvalue Problems by Parallel Block Damping Inverse Power Method

We propose an eigensolver and the corresponding package, GCGE, for solvi...

A structure preserving shift-invert infinite Arnoldi algorithm for a class of delay eigenvalue problems with Hamiltonian symmetry

In this work we consider a class of non-linear eigenvalue problems that ...

On the shift-invert Lanczos method for the buckling eigenvalue problem

We consider the problem of extracting a few desired eigenpairs of the bu...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.