TL;DR
The paper introduces an efficient method for calculating optical absorption spectra in periodic solids by approximating the Bethe-Salpeter Hamiltonian, significantly reducing computational costs while maintaining accuracy.
Contribution
It develops a novel interpolative separable density fitting technique to construct the Bethe-Salpeter Hamiltonian with near-linear scaling, enabling faster spectrum calculations.
Findings
Achieves nearly linear scaling in Hamiltonian construction.
Reduces computation time from hours to minutes for large systems.
Maintains accuracy comparable to brute force methods.
Abstract
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 with respect to the number of samples in the Brillouin zone . In addition, we show that the cost for applying the Bethe-Salpeter Hamiltonian to a vector scales as . 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 and scaling associated with a brute force approach for constructing the Hamiltonian…
| Parameters | Diamond | Graphene |
|---|---|---|
| Error in | ||
|---|---|---|
| Absorption Function | First Eigenvalue | |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Fast optical absorption spectra calculations
for periodic solid state systems
Felix Henneke Institut für Mathematik, Freie Universität Berlin, Germany, Email: [email protected]
Lin Lin Department of Mathematics, University of California, Berkeley, and Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720. Email: [email protected]
Christian Vorwerk Institut für Physik and IRIS Adlershof, Humboldt-Universität zu Berlin, Germany, Email: [email protected]
Claudia Draxl Institut für Physik and IRIS Adlershof, Humboldt-Universität zu Berlin, Germany, Germany, Email: [email protected]
Rupert Klein Institut für Mathematik, Freie Universität Berlin, Germany, Email: [email protected]
Chao Yang Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720. Email: [email protected]
Abstract
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 with respect to the number of samples in the Brillouin zone . In addition, we show that the cost for applying the Bethe-Salpeter Hamiltonian to a vector scales as . 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 and 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 , it takes hours to assemble the Bethe-Salpeter Hamiltonian and hours to fully diagonalize the Hamiltonian using cores when the brute force approach is used. The new method takes less than minutes to set up the Hamiltonian and minutes to compute the absorption spectrum on a single core.
keywords:
Bethe–Salpeter equation, interpolative separable density fitting, optical absorption function
AMS:
65F15, 65Z05
1 Introduction
The Bethe–Salpeter equation (BSE), derived from the many-body perturbation theory (MBPT), is a widely used method for describing the optical absorption process in molecules and solids [31, 32, 35, 23, 1, 24, 6]. It models the behavior of an electron–hole pair, which is an excitation process with two quasi-particles. Solving BSE requires constructing and diagonalizing a structured matrix, called the Bethe–Salpeter Hamiltonian (BSH). In the context of optical absorption, the eigenvalues of the BSH are the exciton energies and the corresponding eigenfunctions yield the exciton wavefunctions. The BSH consists of the so called bare exchange and screened direct interaction kernels that depend on single-particle orbitals obtained from a quasi-particle (usually at the GW level) or mean-field calculation. For isolated systems such as molecules, the construction of these kernels requires at least operations in a conventional approach, where is the number of electrons in the system. This is very costly for large systems that contain hundreds or more atoms. Recent efforts have actively explored methods for efficient representation of the BSH, in order to reduce the high computational cost of BSE calculations [3, 13, 16, 21, 29, 26, 27, 30].
In a recent work [12], two of the authors have presented an efficient way to construct the BSH for molecular systems, and to efficiently solve the BSE eigenvalue problem using an iterative scheme. Our approach is based on the recently-developed interpolative separable density fitting (ISDF) decomposition [19, 20]. The ISDF decomposition has been applied to accelerate a number of applications in computational chemistry and materials science, including the computation of two-electrons integrals [19], correlation energy in the random phase approximation [18], density functional perturbation theory [15], and hybrid density functional calculations [11, 7]. In this scheme, a matrix consisting of products of single-particle orbital pairs is efficiently approximated as a low-rank matrix product, between a matrix built with a small number of auxiliary basis vectors and an expansion coefficient matrix. This decomposition allows us to construct efficient representations to the bare exchange and screened direct kernels. For isolated systems, the construction of the ISDF-compressed BSH matrix only requires operations when the rank of the numerical auxiliary basis is kept at . This results in considerate reduction of the cost compared to the complexity required in a conventional approach. By keeping the interaction kernels in a decomposed form, the matrix–vector multiplications required in the iterative diagonalization procedures of the Hamiltonian can be performed efficiently. We can further use these efficient matrix–vector multiplications in a structure preserving Lanczos algorithm [33] to obtain an approximate absorption spectrum without an explicit diagonalization of the approximate .
This paper generalizes the work in [12] to periodic solid state systems. According to the Bloch decomposition, each single particle orbital in a periodic system can be characterized by an orbital index , and a Brillouin zone index . Compared to isolated systems, the total number of electrons is equal to the number of electrons per unit cell multiplied by the number of points denoted by . It has been observed that for many extended systems, the number of orbitals (both occupied and virtual orbitals) required for one particular index can be relatively small, and is independent of . Hence the difficulty of optical absorption spectra calculations for periodic systems mainly arise from the large number of -points. This is particularly the case when the excitons are delocalized in the real space, or when the Fermi-surface is not smooth (such as graphene, and other metallic systems). In such case, can often be rather large (from hundreds to hundreds of thousands, see e.g. [28], where a -grid is used for the quasi two-dimensional MoS2 system) in order to properly discretize and sample the Brillouin zone. The cost for constructing the bare exchange and screened direct kernels scales as , while the cost for diagonalizing the corresponding BSH scales as . This is prohibitively expensive when a dense discretization of the Brillouin zone is needed.
With the help of ISDF, we can find a reduced representation of the pair product orbitals in the periodic setting [20]. Such a reduced representation is possible, thanks to the smoothness of the single particle orbitals with respect to the index, and that the Brillouin zone is a compact domain. We will show that we can reduce the complexity of the bare exchange and screened direct kernel construction for extended systems to the optimal complexity of . Instead of diagonalizing the BSH directly, we use iterative methods such as the Lanczos method to evaluate the optical absorption spectrum. The complexity of applying the approximated kernels to a vector with respect to is only . The same strategy can be applied to evaluate selected excitation energies.
The rest of the paper is organized as follows. We first provide a concise review of the single particle theory and the Bethe-Salpeter equation for periodic systems in section 2. We could not find a precise mathematical description of how the BSH is constructed for periodic systems with a discretized Brillouin zone in the literature. We therefore provide a self-contained derivation in section 2.2. The interpolative separable density fitting for periodic systems is introduced in section 3, and the application of the approximate BSH in the ISDF format to a vector in section 4. The numerical results are presented in section 5, followed by a conclusion in section 6.
2 Preliminaries
2.1 Single particle theory for periodic systems
To facilitate further discussion we briefly review Bloch-Floquet theory for periodic systems. Without loss of generality we consider a three-dimensional crystal. The Bravais lattice with lattice vectors is defined as
[TABLE]
In single particle theories such as the Kohn-Sham density functional theory, the self-consistent effective potential is real-valued and -periodic, i.e.
[TABLE]
The unit cell is defined as
[TABLE]
The Bravais lattice induces a reciprocal lattice , with its lattice vectors satisfying . The unit cell of the reciprocal lattice is called the (first) Brillouin zone and denoted by , defined as
[TABLE]
The Brillouin zone has a number of special points related to the symmetry of the crystal. The common special point is the -point, which corresponds to .
According to the Bloch-Floquet theory, the spectrum of the Hamiltonian can be relabeled using two indices , where is called the band index and is the Brillouin zone index. Each generalized eigenfunction is known as a Bloch orbital and satisfies with Bloch boundary conditions for any . Furthermore, can be decomposed using the Bloch decomposition
[TABLE]
where is the periodic part of satisfying the periodic boundary condition on the unit cell
[TABLE]
It can be directly obtained by solving the eigenvalue problem
[TABLE]
where . For each , the eigenvalues are ordered non-decreasingly. For a fixed , as a function of is called a Bloch band. The collection of all eigenvalues forms the band structure of the crystal, which characterizes the spectrum of the operator .
In the discussion below, we denote by the number of valence bands (i.e., occupied orbitals per unit cell in the ground state), the number of conduction bands (i.e. unoccupied orbitals per unit cell in the ground state). We also define . We assume the systems to be insulating, in the sense that the following band isolation conditions between the valence and conduction bands are satisfied:
[TABLE]
Denote by the volume of the unit cell, and
[TABLE]
the volume of the Brillouin zone. The Bloch orbitals satisfy the orthonormality condition in the distributional sense
[TABLE]
Here is the Kronecker symbol for a discrete set, while is the Dirac-delta distribution. Equation (2.7) implies the normalization condition when integrated over the Brillouin zone
[TABLE]
From the Bloch orbitals, the ground state electron density can be constructed as
[TABLE]
In order to practically perform calculations for periodic systems, the integration with respect to the Brillouin zone needs to be discretized using a quadrature. The most commonly used scheme is based on the Monkhorst-Pack grid [22]
[TABLE]
It is clear that and that it corresponds to a uniform discretization of the Brillouin zone. When the shift vector , we denote by , and the calculation of periodic systems can be equivalently performed using a supercell consisting of unit cells. The supercell is denoted by , and is further equipped with periodic boundary condition called the Born-von Karman boundary condition [2]. The calculation of a periodic crystal can thus be recovered by taking the limit . We denote by the total number of unit cells, or equivalently the total number of Monkhorst-Pack grid points in the Brillouin zone.
Assuming the Brillouin zone is discretized using , the orthogonality condition (2.7) becomes
[TABLE]
We also modify the Bloch decomposition as
[TABLE]
Here the normalization factor is introduced so that the orthogonality condition for the periodic part implies
[TABLE]
To facilitate the book-keeping effort of various relevant constants in practical calculations, in the discussion below we will always assume that the Brillouin zone is discretized into with a corresponding supercell . The volume of the supercell is . The unit cell is further discretized into a uniform grid . Practical BSE calculations often truncate the number of conduction bands aggressively, in the sense that . Numerical results indicate that in many cases, the low-lying excitation spectrum is relatively insensitive to , and one can often choose . Unless otherwise clarified, we may not distinguish a continuous vector and the corresponding discretized vector . Similarly, when the context is clear, we do not distinguish the kernel of an operator and its discretized matrix .
2.2 Bethe-Salpeter equation for periodic systems
The Bethe–Salpeter equation is an eigenvalue problem of the form
[TABLE]
where is the Bethe–Salpeter Hamiltonian (BSH), is the exciton wavefunction, and is the corresponding exciton energy. For periodic systems, the BSH has the following block structure
[TABLE]
where is an diagonal matrix. The quasi-particle energies are typically obtained from a GW calculation [31]. The and matrices represent the bare exchange interaction of electron–hole pairs, and the and matrices are referred to as the screened direct interaction of electron–hole pairs. These matrices are defined as follows:
[TABLE]
Here and are the valence and conduction single-particle orbitals typically obtained from a Kohn–Sham density functional theory (KSDFT) calculation respectively, and and are the bare and screened Coulomb interactions. Both and are Hermitian, whereas and are complex symmetric. Within the so-called Tamm–Dancoff approximation (TDA) [24], both and are neglected in Equation (2.15). In this case, the becomes Hermitian and we can focus on computing the upper left block of .
In the following discussion, when a single index is used, it refers to either or . Using the Bloch decomposition (2.12), the matrix elements of the BSH can be written using the periodic part of the orbitals as
[TABLE]
Note that in Eq. (2.17) do not involve the phase factors, since the factor exactly cancels due to the complex conjugate operation. The phase factor only appears in the terms.
Eq. (2.17) requires the evaluation of integrals of the following form
[TABLE]
and
[TABLE]
Using such notation,
[TABLE]
In Eq. (2.18), (2.19), are periodic functions in the unit cell, and can be represented using their Fourier representations. For instance,
[TABLE]
and its Fourier coefficients can be computed as
[TABLE]
Hence Parseval’s identity reads
[TABLE]
Both of the kernels satisfy the translation symmetry
[TABLE]
Eq. (2.24) also defines the values of for beyond the supercell . The Fourier representation of takes the form
[TABLE]
and the Fourier coefficients can be computed as
[TABLE]
Similarly, the Fourier representation for can be defined.
It should be noted that the Coulomb kernel only depends on the distance between and , i.e. it has further translational symmetry property that
[TABLE]
As a result, its Fourier transform can be simplified into a diagonal matrix
[TABLE]
In fact, the Coulomb kernel periodized with respect to the supercell is defined to be the inverse Fourier transform of Eq. (2.28).
Using such notation, we have
[TABLE]
Here we have used , the fact that is periodic with respect to the unit cell , as well as the identity
[TABLE]
Furthermore, from Eq. (2.22) and the identity
[TABLE]
we have
[TABLE]
Compared to Eq. (2.28), the definition of should be modified to
[TABLE]
Another way to understand Eq. (2.32) is that it can only be applied to a mean zero function , such that . In other words, should be in the range of the Laplacian operator with the periodic boundary condition. This is indeed correct for BSE calculations, due to the orthogonality condition between the valence and conduction bands
[TABLE]
This implies
[TABLE]
Similarly for the part,
[TABLE]
In order to obtain a non-vanishing quantity in the equation above, note that the quantity if , and is otherwise [math]. Therefore the summation with respect to should be restricted to those satisfying
[TABLE]
Since is restricted to the first Brillouin zone, there is a unique (and therefore ) for each given satisfying this relation. Also note that may exceed the first Brillouin zone. In other words, it is indeed possible to have . Then for a given ,
[TABLE]
In the last equality, we have used the definition of the Fourier coefficients in Eq. (2.26). We then readily have
[TABLE]
Therefore, despite that is significantly more complex to define, the resulting formula in the Fourier representation is remarkably similar to the form of .
3 Interpolative separable density fitting for periodic systems
In order to reduce the computational complexity, we seek to minimize the number of integrals in Equation (2.16). We will use the interpolative separable density fitting decomposition (ISDF) [19, 20]. For periodic systems, we first consider the following general form of decomposition
[TABLE]
When the unit cell is discretized into a uniform grid , can be viewed as a matrix with its row index being , and the column index being a multi-index . The matrix size is thus (recall that ). For a given , can be viewed as a row vector of size . The ISDF decomposition then states that all such matrix rows can be approximately expanded using a linear combination of matrix rows with respect to a selected set of interpolation points . The coefficients of such a linear combination, or interpolating vectors, are denoted by . Here can be interpreted as the numerical rank of the ISDF decomposition.
The compression of the pair products can be understood from the following two limits. First, if only the point is used to sample the Brillouin zone, we find that there are pairs of functions. However, the number of grid points only scales linearly with respect to . Hence the numerical rank of the pair products must scale asymptotically as . In fact, when all orbitals are smooth functions, we can expect that the numerical rank to be much lower than . This statement has been confirmed by recent analysis [17]. Second, if a large number of -points are used to discretize the Brillouin zone, are often relatively small, and the number of grid points in the unit cell does not increase with respect to . Hence as increases, we may also expect that the numerical rank will be determined by smoothness of with respect to , and is asymptotically independent of . This is indeed what we observe in numerical results. Throughout the discussion below, we will focus on the second scenario, i.e. we will explicitly write down the scaling with respect to and , but we will primarily focus on the scaling with respect to .
Assume the interpolation points are already chosen, the interpolation vectors can be efficiently evaluated using a least squares method as follows [11]. Using a linear algebra notation, Eq. (3.1) can be written as
[TABLE]
Here contains the interpolating vectors. Each column of indexed by is given by
[TABLE]
Eq. (3.2) is an over-determined linear system with respect to the interpolation vectors . The least squares approximation to the solution is given by
[TABLE]
Due to the tensor product structure of and , the matrix-matrix multiplications and can be carried out efficiently [11], with computational cost being and , respectively. The cost of inverting the matrix is , and the overall cost evaluating is thus bounded by . Hence the cost scales cubically with respect to the number of electrons in the unit cell, and linearly with respect to the number of points.
Eq. (3.1) is the general form of ISDF. In the BSE calculations, we may further distinguish whether should take valence or conduction band indices only, as well as whether can be set to be the same. For instance, Eq. (2.17) suggests that in order to compress , we only need the following ISDF decomposition:
[TABLE]
Note that the number of columns of the matrix is only , and the number of fitting functions can be chosen to be less than . The computation of requires the general ISDF format (3.1).
The interpolations points can be chosen via a QR factorization with column pivoting (QRCP) method [8], with randomization to reduce the computational cost. We refer readers to [19, 20] for details of the randomized QRCP method for evaluating the interpolation points. Other methods can also be used as well to find the interpolation points as well, such as the method based on the centroidal Voronoi decomposition (CVT) [7].
4 Fast algorithm for applying the BSH to a vector
Once the ISDF decomposition is obtained, we may compute the following matrix elements
[TABLE]
and similarly
[TABLE]
The expressions in Eq. (2.17) can then be approximated in the ISDF format as
[TABLE]
In order to use the Fourier representation (2.33) and (2.36), we first need to perform Fourier transform for and . Using the fast Fourier transform (FFT), and assuming that the number of Fourier coefficients is also , the computational cost for the Fourier transform scales as and , respectively. The Fourier coefficients can be obtained analytically, and we assume the coefficients are already provided from e.g. a GW calculation. The cost for computing using Eq. (2.33) is then . Similarly the cost for computing all matrices is . In particular, the total cost for the initial setup stage scales as with respect to the number of -points.
After this initial setup stage, each entry of the BSH can be computed with operations. If the entire BSH matrix is to be constructed, the cost will be .
Below we demonstrate that if we only aim at applying the Hamiltonian to an arbitrary vector without ever assembling the full Hamiltonian, the computational cost can be greatly reduced.
For simplicity, let us focus on the case when the Tamm–Dancoff approximation (TDA) is used. Applying the Hamiltonian to a vector amounts to evaluating the three terms
[TABLE]
Computing the first term for all clearly costs operations. We now show that the second and third term can also be computed efficiently.
Using (4.3), the second term in (4.4) can be regrouped as
[TABLE]
This means that one can first perform contractions over , , and to obtain a quantity which only depends on . The computational complexity is . The two remaining sums can be computed with operations. The total complexity of computing is bounded by .
For the third term in (4.4) we obtain
[TABLE]
Here, the two innermost contractions over and result in a quantity that only depends on , , and . The cost for these two steps is . The sum over has the structure of a discrete convolution, for each fixed pair. Therefore it can be computed for all simultaneously in operations by fast convolution algorithms, e.g., by using FFT with zero-padded vectors. The remaining summation operations over and are then obtained with operations. In total the computation of amounts to operations.
Combining the results for the three parts of the Hamiltonian, we see that the computational complexity is given by
[TABLE]
In particular, the cost with respect to the number of points only scales as . This allows us to perform BSE calculations for complex materials which requires a very large number of -points.
By avoiding the explicit construction of , the new algorithm also drastically reduces the storage cost. The storage cost for alone is . In the new algorithm, the storage cost of becomes the dominant component and scales only linearly with respect to .
As an example, the matrix-free application of can be used to compute the optical absorption spectrum, which requires the evaluation of the following quantity
[TABLE]
Here and are called the right and left optical transition vectors, and is a broadening factor used to account for the exciton lifetime. We also compute the smallest eigenvalue of which are of interest in their own right, as they represent the transition energies of bound excitons in many semiconducting solid state materials.
To observe the absorption spectrum and identify its main peaks, it is possible to use a structure preserving iterative method instead of explicitly computing all eigenpairs of . We refer readers to Ref. [5, 33] for details of the structure preserving Lanczos algorithm, which has been implemented in the BSEPACK [34] library. When TDA is used, the structure preserving Lanczos reduces to a standard Lanczos algorithm. For the computation of the first eigenvalue we use standard ARPACK [14] routines for Hermitian matrices.
5 Numerical Examples
To illustrate the efficiency of ISDF for BSE calculations in crystals, we apply the method to compute the excitation modes and absorption spectra of a one-dimensional model problem as well as two real material systems, diamond (3D bulk) and graphene (quasi-2D). For both systems, we determine the optical absorption spectra on -grids close to those employed in previously published calculations to demonstrate that our method is suitable for state-of-the-art calculations, both for 3D and quasi-2D materials. We furthermore provide a numerical scaling analysis and a more detailed analysis of the error in the ISDF in the case of the one-dimensional model and diamond. We show that a good approximation of the spectrum can be obtained with a small number of interpolation vectors.
The method was implemented in Julia [4] and the source code is available at github.com/fhenneke/BSE_k_ISDF.jl. As input to our method for the actual materials, we employ the KSDFT single-particle orbitals, quasi-particle energies and screened Coulomb potential computed by exciting [9, 36], an all-electron full-potential code with implementations of density functional theory and many-body perturbation theory. The Tamm–Dancoff approximation is used in all calculations.
All calculation for the proposed method were carried out on a single core of an i5-8250U CPU at 1.60GHz.
5.1 One-dimensional problems
For the one-dimensional problem, we take the single particle orbitals in (2.16) to be eigenfunctions of a single particle Hamiltonian in which the effective potential is defined as
[TABLE]
where the unit cell size is .
The bare Coulomb potential used in (2.16) is chosen to be
[TABLE]
and the screened interactions is chosen as
[TABLE]
Compared to the smoothed out Coulomb potential , the chosen screened interaction decays exponentially and also contains lattice periodic contributions. The potentials are shown in Figure 5.1. Both potentials are periodically extended times outside of the unit cell. The particular structure of the potentials has an influence on the band structure and spectrum of the BSH, but was observed to not significantly impact the convergence behavior or the runtime scaling of the ISDF method.
The Bloch functions are sampled on uniformly distributed grid points within the unit cell, and the number of points ranges from to in our experiments.
For each point, the first four eigenstates are treated as the valence states in this model, while the remaining eigenstates are considered as the conduction states, separated by an energy gap from the former. We use all valence bands and conduction bands to construct the approximate . The number of points was chosen to be in the error analysis of the ISDF approximation, and varies from to in the run time analysis and the analysis of the error in the absorption spectrum. The largest resulting Hamiltonian is of size .
Figure 5.2 shows how the ISDF approximation error varies with respect to the truncation parameter and how the accuracy of the approximate spectrum of changes with respect to the ISDF approximation error.
In the left subfigure, we plot the relative error , , where is the Frobenius norm, for different choices of truncation levels (or number of interpolation points). As expected, when is too small, ISDF results in relatively large error. As becomes slightly larger, the ISDF approximation error decays exponentially with respect to up to . At this truncation level, the error is on the order of , which is sufficiently small for obtaining an highly accurate approximation of the spectrum of as shown in the right subfigure. In this subfigure, we plot the relative error in the first eigenvalue and in the overall optical absorption spectrum against the ISDF error tolerance . For each , we choose the smallest truncation parameters ’s with the resulting error in being lesser or equal to for .
In Figure 5.3, we plot the timing measurements for both the construction of and and the multiplication of the approximate with a vector with respect to . In these calculations, the ISDF truncation parameters ’s are chosen so that the relative error in is below . This error tolerance resulted in the choices of , , and .
As we can see in Figure 5.3, the scaling of the runtime for the construction of and is nearly linear with respect to , which is in excellent agreement with the theoretical computational complexity presented in the preceeding section. The scaling of the runtime for the multiplication of the approximate with a vector also looks linear in . In fact, a more detailed investigation showed that the convolutions in in the application of dominate the cost of the matrix-vector multiplications, in good agreement with the theoretical complexity shown earlier.
For comparison, without the use of ISDF, the construction of is estimated to take about seconds for . With our method it took less than seconds.
5.2 Three-dimensional problems
We now compare optical absorption spectra for diamond and graphene computed from the approximate constructed via ISDF with corresponding reference spectra. The reference spectra are obtained from the exact from the exciting code [9, 36]. The comparison is shown in Figure 5.4. The reference spectrum for diamond is constructed on a -grid using all 4 valence and 10 conduction states. Fourier components in Eq. (2.35) are calculated up to a cut-off , where is the Bohr radius. The screened Coulomb interaction is calculated within the random-phase approximation (RPA) including 100 conduction states. For graphene, the reference spectrum is obtained on a -grid using all 4 valence and 5 conduction states. Fourier components in Eq. (2.35) are calculated up to a cut-off and 80 conduction states are included in the RPA calculations for the screened Coulomb potential. The numerical parameters of the reference and approximate calculations are shown in Table 1. The number of interpolation vectors was chosen such that the relative ISDF error was around .
We can clearly see that for both diamond and graphene, the approximate optical absorption spectrum matches well with the reference spectrum. In particular, the positions and heights of all major peaks are in good agreement. We should note that, in the case of diamond, the absorption spectrum produced by a -grid is in good agreement with measurements [25] and previous BSE calculations [10]. In the case of graphene, however, larger -grids have been reported for BSE calculations [37] to produce an optical absorption spectrum in good agreement with the experimental result.
Figure 5.5 shows that the ISDF approximation error can be systematically reduced as we increase the number interpolating vectors . However, Figure 5.4 shows that the approximate absorption spectrum is already in good agreement with the reference spectrum, when the relative ISDF approximation error is at . Thus, it seems unnecessary to use a larger number of interpolation vectors in these cases. This observation is corroborated by the relative difference between the first eigenvalue of the approximate computed using ARPACK and that of reference constructed in exciting shown in Table 2. With a relative ISDF approximation error of , the error in the first BSE eigenvalue is below in both examples shown here.
To illustrate the run time scaling of the method in the 3D examples, we measure the time it takes to construct the approximate via ISDF as well as the time it takes to multiply the resulting with vectors for the diamond example. We use -grids of sizes for . The resulting timing measurements are plotted in Figure 5.6. It can be seen that the runtime for constructing the approximate scales linearly with the number of -points. The multiplication of with vectors scales as for sufficiently large . As in the model problem, the convolutions in in the application of dominate the cost of the matrix-vector multiplications. For comparison, computing the ISDF decomposition of the Hamiltonian for the case took seconds, whereas the full assembly of the Hamiltonian took about 6 hours in exciting on 13 compute nodes with 13 cores each. The optical absorption function was obtained by running about Lanczos steps, which amounts to about minutes for each fixed direction (x, y, and z), compared to almost 4 hours required in the exciting code for the full diagonalization on 13 compute nodes.
6 Conclusion
In this paper, we examined the possibility of using the ISDF technique to reduce the computational complexity of BSH construction and the subsequent iterative approximation of the optical absorption spectrum and excitation energies of electron-hole (exciton) pairs for solids. For periodic systems, a fine -point sampling in the Brillouin zone is often required to produce accurate results, whereas the number of bands per -point required to construct the bare exchange and screened direct kernels of the BSH is relatively small. We showed that the complexity of the ISDF procedure scales linearly with respect to the number of points () when the ranks of the approximate bare exchange and screened direct kernels produced by the ISDF procedure are chosen to be independent of . By keeping the bare exchange and screened direct kernels in the low-rank decomposed form produced by the ISDF procedure, an iterative method used to obtain the optical absorption spectrum and selected excitation energies (eigenvalues of the BSH) can be implemented with cost scaling as . Our numerical experiments, which were performed on a 1D model as well as two different types of actual materials (diamond and graphene), confirm our complexity analysis. They demonstrate that the ISDF technique can indeed significantly reduce the cost of BSE calculation for solids while maintaining the same accuracy provided by a standard BSE calculation implemented in the software exciting. Our current implementation of the ISDF technique is done using the Julia programming language for a single node. A distributed parallel implementation is needed to accommodate a much finer -point sampling which is required in case of the graphene example to produce a computed absorption spectrum that matches with experimental results.
Acknowledgments
This work was partially supported by the Department of Energy under grant DE-SC0017867 (L.L.), by the Center for Computational Study of Excited-State Phenomena in Energy Materials (C2SEPEM) at the Lawrence Berkeley National Laboratory, which is funded by the U. S. Department of Energy, Office of Science, Basic Energy Sciences, Materials Sciences and Engineering Division, under Contract No. DE-AC02-05CH11231 (C.Y.), by the Scientific Discovery through Advanced Computing (SciDAC) program, and by the CAMERA program (L.L. and C.Y.). Within a framework cooperations between the University of California at Berkeley and Freie Universität Berlin, the latter sponsored an extended visit of F.H. and R.K. in Berkeley. We thank Wei Hu, Meiyue Shao and Kyle Thicke for helpful discussions. C.D. and R.K. thank IPAM, UCLA, for its support during the 2013 fall program on “Materials for a sustainable energy future” and for creating the inspiring scientific atmosphere that initiated their collaboration.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Stefan Albrecht, Giovanni Onida, and Lucia Reining , Ab initio calculation of the quasiparticle spectrum and excitonic effects in li 2 subscript li 2 {\mathrm{li}}_{2} o , Phys. Rev. B, 55 (1997), pp. 10278–10281.
- 2[2] Neil W. Ashcroft and David N. Mermin , Solid state physics , Harcourt, New York, 1976.
- 3[3] Peter Benner, Sergey Dolgov, Venera Khoromskaia, and Boris N. Khoromskij , Fast iterative solution of the Bethe–Salpeter eigenvalue problem using low-rank and QTT tensor approximation , J. Comput. Phys., 334 (2017), pp. 221–239.
- 4[4] J. Bezanson, A. Edelman, S. Karpinski, and V. Shah , Julia: A fresh approach to numerical computing , SIAM Review, 59 (2017), pp. 65–98.
- 5[5] J. Brabec, L. Lin, M. Shao, N. Govind, Y. Saad, C. Yang, and E. G. Ng , Efficient algorithms for estimating the absorption spectrum within linear response TDDFT , J. Chem. Theory Comput., 11 (2015), pp. 5197–5208.
- 6[6] J. Deslippe, G. Samsonidze, D. A. Strubbe, M. Jain, M. L. Cohen, and S. G. Louie , Berkeley GW: A massively parallel computer package for the calculation of the quasiparticle and optical properties of materials and nanostructures , Comput. Phys. Commun., 183 (2012), pp. 1269–1289.
- 7[7] K. Dong, W. Hu, and L. Lin , Interpolative separable density fitting through centroidal Voronoi tessellation with applications to hybrid functional electronic structure calculations , J. Chem. Theory Comput., 14 (2018), p. 1311.
- 8[8] G. H. Golub and C. F. Van Loan , Matrix computations , Johns Hopkins Univ. Press, Baltimore, fourth ed., 2013.
