We consider approximate computation of several minimal eigenpairs of large Hermitian matrices which come from high-dimensional problems. We use the tensor train (TT) format for vectors and matrices to overcome the curse of dimensionality and make storage and computational cost feasible. We approximate several low-lying eigenvectors simultaneously in the block version of the TT format. The computation is done by the alternating minimization of the block Rayleigh quotient sequentially for all TT cores. The proposed method combines the advances of the density matrix renormalization group (DMRG) and the variational numerical renormalization group (vNRG) methods. We compare the performance of the proposed method with several versions of the DMRG...
We consider the problem of developing parallel decomposition and approximation algorithms for high d...
In a block algorithm for computing relatively high-dimensional eigenspaces of large sparse symmetric...
The density matrix renormalization group (DMRG) is one of the most powerful numerical methods availa...
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermit...
We consider elliptic PDE eigenvalue problems on a tensorized domain, discretized such that the resul...
We propose algorithms for the solution of high-dimensional symmetrical positive definite (SPD) linea...
We propose new algorithms for singular value decomposition (SVD) of very large-scale ma-trices based...
Computing a few eigenpairs from large-scale symmetric eigenvalue problems is far beyond the tractabi...
We propose algorithms for the solution of high-dimensional symmetrical positive definite (SPD) linea...
We consider the solution of large-scale symmetric eigenvalue problems for which it is known that the...
The standard algorithms for dense matrices become expensive for large matrices, since the number of ...
Abstract. We consider the solution of large-scale symmetric eigenvalue problems for which it is know...
The coming century is surely the century of high dimensional data. With the rapid growth of computat...
Quantification of stochastic or quantum systems by a joint probability density or wave function is a...
. In this paper a parallel algorithm for finding a group of extreme eigenvalues is presented. The al...
We consider the problem of developing parallel decomposition and approximation algorithms for high d...
In a block algorithm for computing relatively high-dimensional eigenspaces of large sparse symmetric...
The density matrix renormalization group (DMRG) is one of the most powerful numerical methods availa...
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermit...
We consider elliptic PDE eigenvalue problems on a tensorized domain, discretized such that the resul...
We propose algorithms for the solution of high-dimensional symmetrical positive definite (SPD) linea...
We propose new algorithms for singular value decomposition (SVD) of very large-scale ma-trices based...
Computing a few eigenpairs from large-scale symmetric eigenvalue problems is far beyond the tractabi...
We propose algorithms for the solution of high-dimensional symmetrical positive definite (SPD) linea...
We consider the solution of large-scale symmetric eigenvalue problems for which it is known that the...
The standard algorithms for dense matrices become expensive for large matrices, since the number of ...
Abstract. We consider the solution of large-scale symmetric eigenvalue problems for which it is know...
The coming century is surely the century of high dimensional data. With the rapid growth of computat...
Quantification of stochastic or quantum systems by a joint probability density or wave function is a...
. In this paper a parallel algorithm for finding a group of extreme eigenvalues is presented. The al...
We consider the problem of developing parallel decomposition and approximation algorithms for high d...
In a block algorithm for computing relatively high-dimensional eigenspaces of large sparse symmetric...
The density matrix renormalization group (DMRG) is one of the most powerful numerical methods availa...