UZH-Logo

Use of tensor formats in elliptic eigenvalue problems


Hackbusch, W; Khoromskij, B; Sauter, S; Tyrtyshnikov, E E (2011). Use of tensor formats in elliptic eigenvalue problems. Numerical Linear Algebra with Applications, 19(1):133-151.

Abstract

We investigate approximations by finite sums of products of functions with separated
variables to eigenfunctions of certain class of elliptic operators in higher dimensions,
and especially conditions providing an exponential decrease of the error with
respect to the number of terms. The results of the consistent use of tensor formats
can be regarded as a base for a new class of rank truncated iterative eigensolvers
with almost linear complexity in the univariate problem size that improves dramatically
the traditional methods of linear scaling in the volume size. Tensor methods
can be applied to solving large scale spectral problems in the computational quantum
chemistry, for example to the Schr¨odinger, Hartree-Fock and Kohn-Sham equations in
electronic structure calculations. The results of numerical experiments clearly indicate
the linear-logarithmic scaling of low-rank tensor method in the univariate problem size.
The algorithms work equally well for the computation of both, minimal and maximal
eigenvalues of the discrete elliptic operators.

We investigate approximations by finite sums of products of functions with separated
variables to eigenfunctions of certain class of elliptic operators in higher dimensions,
and especially conditions providing an exponential decrease of the error with
respect to the number of terms. The results of the consistent use of tensor formats
can be regarded as a base for a new class of rank truncated iterative eigensolvers
with almost linear complexity in the univariate problem size that improves dramatically
the traditional methods of linear scaling in the volume size. Tensor methods
can be applied to solving large scale spectral problems in the computational quantum
chemistry, for example to the Schr¨odinger, Hartree-Fock and Kohn-Sham equations in
electronic structure calculations. The results of numerical experiments clearly indicate
the linear-logarithmic scaling of low-rank tensor method in the univariate problem size.
The algorithms work equally well for the computation of both, minimal and maximal
eigenvalues of the discrete elliptic operators.

Citations

8 citations in Web of Science®
8 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

0 downloads since deposited on 21 Sep 2011
0 downloads since 12 months

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Language:English
Date:2011
Deposited On:21 Sep 2011 10:07
Last Modified:05 Apr 2016 15:01
Publisher:Wiley-Blackwell
ISSN:1070-5325
Publisher DOI:10.1002/nla.793
Permanent URL: http://doi.org/10.5167/uzh-49741

Download

[img]
Content: Accepted Version
Filetype: PDF - Registered users only
Size: 2MB
View at publisher

TrendTerms

TrendTerms displays relevant terms of the abstract of this publication and related documents on a map. The terms and their relations were extracted from ZORA using word statistics. Their timelines are taken from ZORA as well. The bubble size of a term is proportional to the number of documents where the term occurs. Red, orange, yellow and green colors are used for terms that occur in the current document; red indicates high interlinkedness of a term with other terms, orange, yellow and green decreasing interlinkedness. Blue is used for terms that have a relation with the terms in this document, but occur in other documents.
You can navigate and zoom the map. Mouse-hovering a term displays its timeline, clicking it yields the associated documents.

Author Collaborations