Name
Abstract | ||
|---|---|---|
We consider the solution of large-scale symmetric eigenvalue problems for which it is known that the eigenvectors admit a low-rank tensor approximation. Such problems arise, for example, from the discretization of high-dimensional elliptic PDE eigenvalue problems or in strongly correlated spin systems. Our methods are built on imposing low-rank (block) tensor train (TT) structure on the trace minimization characterization of the eigenvalues. The common approach of alternating optimization is combined with an enrichment of the TT cores by (preconditioned) gradients, as recently proposed by Dolgov and Savostyanov for linear systems. This can equivalently be viewed as a subspace correction technique. Several numerical experiments demonstrate the performance gains from using this technique. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1137/130949919 | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
ALS,DMRG,high-dimensional eigenvalue problems,LOBPCG,low-rank tensor methods,trace minimization,tensor train format | Tensor density,Mathematical optimization,Tensor (intrinsic definition),Tensor,Mathematical analysis,LOBPCG,Symmetric tensor,Divide-and-conquer eigenvalue algorithm,Tensor contraction,Mathematics,Eigenvalues and eigenvectors | Journal |
Volume | Issue | ISSN |
36 | 5 | 1064-8275 |
Citations | PageRank | References |
19 | 0.77 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Kressner | 1 | 449 | 48.01 |
| Michael Steinlechner | 2 | 28 | 1.55 |
| André Uschmajew | 3 | 135 | 9.34 |