Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
arXiv:1602.02646 · doi:10.1016/j.jcp.2016.12.047
Abstract
In this paper, we study and implement the structural iterative eigensolvers for the large-scale eigenvalue problem in the Bethe-Salpeter equation (BSE) based on the reduced basis approach via low-rank factorizations in generating matrices, introduced in the previous paper. The approach reduces numerical costs down to in the size of atomic orbitals basis set, , instead of practically intractable complexity scaling for the direct diagonalization of the BSE matrix. As an alternative to rank approximation of the static screen interaction part of the BSE matrix, we propose to restrict it to a small active sub-block, with a size balancing the storage for rank-structured representations of other matrix blocks. We demonstrate that the enhanced reduced-block approximation exhibits higher precision within the controlled numerical cost, providing as well a distinct two-sided error estimate for the BSE eigenvalues. It is shown that further reduction of the asymptotic computational cost is possible due to ALS-type iteration in block tensor train (TT) format applied to the quantized-TT (QTT) tensor representation of both long eigenvectors and rank-structured matrix blocks. The QTT-rank of these entities possesses almost the same magnitude as the number of occupied orbitals in the molecular systems, , hence the overall asymptotic complexity for solving the BSE problem can be estimated by . We confirm numerically a considerable decrease in computational time for the presented iterative approach applied to various compact and chain-type molecules, while supporting sufficient accuracy.
23 pages, 11 figures
References in corpus (7)
- The density-matrix renormalization group in the age of matrix product states
- Turbo charging time-dependent density-functional theory with Lanczos chains
- Tensor Numerical Methods in Quantum Chemistry: from Hartree-Fock Energy to Excited States
- Structure Preserving Parallel Algorithms for Solving the Bethe-Salpeter Eigenvalue Problem
- A reduced basis approach for calculation of the Bethe-Salpeter excitation energies using low-rank tensor factorizations
- Calculating excitation energies by extrapolation along adiabatic connections
- Electronic excitation energies of molecular systems from the Bethe-Salpeter equation: Example of the H2 molecule
Cited by in corpus (11)
- A structure preserving Lanczos algorithm for computing the optical absorption spectrum
- Fast optical absorption spectra calculations for periodic solid state systems
- Combined tensor network/cluster expansion method using logic gates: Illustrated for (bi-)excitons by a single layer MoS model system
- Tensor network strategies for calculating biexcitons and trions in monolayer 2D materials beyond the ground state
- Range-separated tensor formats for numerical modeling of many-particle interaction potentials
- Computing the density of states for optical spectra by low-rank and QTT tensor approximation
- Accelerating Optical Absorption Spectra and Exciton Energy Computation for Nanosystems via Interpolative Separable Density Fitting
- Towards a better understanding of the matrix product function approximation algorithm in application to quantum physics
- Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach
- Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem
- Solving the time-independent Schrödinger equation for chains of coupled excitons and phonons using tensor trains