Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
From MaRDI portal
Publication:1685252
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.
Recommendations
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Structure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problems
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation
- Numerical solution of the Hartree-Fock equation in multilevel tensor-structured format
Cites work
- A Chart of Numerical Methods for Structured Eigenvalue Problems
- A Relativistic Equation for Bound-State Problems
- A literature survey of low-rank tensor approximation techniques
- A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
- ARPACK Users' Guide
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- Approximating spectral densities of large matrices
- Approximation of \(2^d\times2^d\) matrices using tensor decomposition
- Black-box Hartree-Fock solver by tensor numerical methods
- Breaking Van Loan’s Curse: A Quest forStructure-Preserving Algorithms for Dense Structured Eigenvalue Problems
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Computation of extreme eigenvalues in higher dimensions using block tensor train format
- Constructive representation of functions in low-rank tensor formats
- Fast solution of parabolic problems in the tensor train/quantized tensor train format with initial application to the Fokker-Planck equation
- Grid-based lattice summation of electrostatic potentials by assembled rank-structured tensor approximation
- Low-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
- Minimization principles for the linear response eigenvalue problem. II: Computation
- Møller-Plesset (MP2) energy correction using tensor factorization of the grid-based two-electron integrals
- Numerical methods for general and structured eigenvalue problems.
- On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Structured Eigenvalue Problems
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Structured tools for structured matrices
- Superfast Fourier transform using QTT approximation
- Tensor Decompositions and Applications
- Tensor numerical methods for multidimensional PDEs: theoretical analysis and initial applications
- Tensor-structured factorized calculation of two-electron integrals in a general basis
- The density-matrix renormalization group in the age of matrix product states
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
Cited in
(11)- Structure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problems
- A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices
- Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach
- Fast optical absorption spectra calculations for periodic solid state systems
- Mathematical methods in quantum chemistry. Abstracts from the workshop held March 18--24, 2018
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- A structure preserving Lanczos algorithm for computing the optical absorption spectrum
- Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem
- Range-separated tensor format for many-particle modeling
- Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation
This page was built for publication: Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685252)
