Fast optical absorption spectra calculations for periodic solid state systems

07/05/2019
by   F. Henneke, et al.
0

We present a method to construct an efficient approximation to the bare exchange and screened direct interaction kernels of the Bethe-Salpeter Hamiltonian for periodic solid state systems via the interpolative separable density fitting technique. We show that the cost of constructing the approximate Bethe-Salpeter Hamiltonian scales nearly optimally as O(N_k) with respect to the number of samples in the Brillouin zone N_k. In addition, we show that the cost for applying the Bethe-Salpeter Hamiltonian to a vector scales as O(N_k log N_k). Therefore the optical absorption spectrum, as well as selected excitation energies can be efficiently computed via iterative methods such as the Lanczos method. This is a significant reduction from the O(N_k^2) and O(N_k^3) scaling associated with a brute force approach for constructing the Hamiltonian and diagonalizing the Hamiltonian respectively. We demonstrate the efficiency and accuracy of this approach with both one-dimensional model problems and three-dimensional real materials (graphene and diamond). For the diamond system with N_k=2197, it takes 6 hours to assemble the Bethe-Salpeter Hamiltonian and 4 hours to fully diagonalize the Hamiltonian using 169 cores when the brute force approach is used. The new method takes less than 3 minutes to set up the Hamiltonian and 24 minutes to compute the absorption spectrum on a single core.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2017

Local optima of the Sherrington-Kirkpatrick Hamiltonian

We study local optima of the Hamiltonian of the Sherrington-Kirkpatrick ...
research
08/12/2023

Runge–Kutta methods determined from extended phase space methods for Hamiltonian systems

We study two existing extended phase space integrators for Hamiltonian s...
research
03/06/2015

Hamiltonian ABC

Approximate Bayesian computation (ABC) is a powerful and elegant framewo...
research
05/10/2020

Structured backward errors for eigenvalues of linear port-Hamiltonian descriptor systems

When computing the eigenstructure of matrix pencils associated with the ...
research
10/06/2021

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 ...
research
09/25/2021

Structure-preserving model order reduction of Hamiltonian systems

We discuss the recent developments of projection-based model order reduc...
research
03/11/2022

Bayesian inference via sparse Hamiltonian flows

A Bayesian coreset is a small, weighted subset of data that replaces the...

Please sign up or login with your details

Forgot password? Click here to reset