Skip to content
BY-NC-ND 4.0 license Open Access Published by De Gruyter January 1, 2011

Preconditioned Low-Rank Methods for High-Dimensional Elliptic PDE Eigenvalue Problems

  • Daniel Kressner EMAIL logo and Christine Tobler

Abstract

We consider elliptic PDE eigenvalue problems on a tensorized domain, discretized such that the resulting matrix eigenvalue problem Ax=λx exhibits Kronecker product structure. In particular, we are concerned with the case of high dimensions, where standard approaches to the solution of matrix eigenvalue problems fail due to the exponentially growing degrees of freedom. Recent work shows that this curse of dimensionality can in many cases be addressed by approximating the desired solution vector x in a low-rank tensor format. In this paper, we use the hierarchical Tucker decomposition to develop a low-rank variant of LOBPCG, a classical preconditioned eigenvalue solver. We also show how the ALS and MALS (DMRG) methods known from computational quantum physics can be adapted to the hierarchical Tucker decomposition. Finally, a combination of ALS and MALS with LOBPCG and with our low-rank variant is proposed. A number of numerical experiments indicate that such combinations represent the methods of choice.

Received: 2011-07-23
Revised: 2011-08-16
Accepted: 2011-09-10
Published Online: 2011
Published in Print: 2011

© Institute of Mathematics, NAS of Belarus

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Downloaded on 19.3.2024 from https://www.degruyter.com/document/doi/10.2478/cmam-2011-0020/html
Scroll to top button