Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen: http://doi.org/10.25358/openscience-5853
Autoren: Bachmayr, Markus
Kazeev, Vladimir
Titel: Stability of low-rank tensor representations and structured multilevel preconditioning for elliptic PDEs
Online-Publikationsdatum: 10-Mai-2021
Erscheinungsdatum: 2020
Sprache des Dokuments: Englisch
Zusammenfassung/Abstract: Folding grid value vectors of size 2L into Lth-order tensors of mode size 2×⋯×2, combined with low-rank representation in the tensor train format, has been shown to result in highly efficient approximations for various classes of functions. These include solutions of elliptic PDEs on nonsmooth domains or with oscillatory data. This tensor-structured approach is attractive because it leads to highly compressed, adaptive approximations based on simple discretizations. Standard choices of the underlying bases, such as piecewise multilinear finite elements on uniform tensor product grids, entail the well-known matrix ill-conditioning of discrete operators. We demonstrate that, for low-rank representations, the use of tensor structure itself additionally introduces representation ill-conditioning, a new effect specific to computations in tensor networks. We analyze the tensor structure of a BPX preconditioner for a second-order linear elliptic operator and construct an explicit tensor-structured representation of the preconditioner, with ranks independent of the number L of discretization levels. The straightforward application of the preconditioner yields discrete operators whose matrix conditioning is uniform with respect to the discretization parameter, but in decompositions that suffer from representation ill-conditioning. By additionally eliminating certain redundancies in the representations of the preconditioned discrete operators, we obtain reduced-rank decompositions that are free of both matrix and representation ill-conditioning. For an iterative solver based on soft thresholding of low-rank tensors, we obtain convergence and complexity estimates and demonstrate its reliability and efficiency for discretizations with up to 250 nodes in each dimension.
DDC-Sachgruppe: 510 Mathematik
510 Mathematics
Veröffentlichende Institution: Johannes Gutenberg-Universität Mainz
Organisationseinheit: FB 08 Physik, Mathematik u. Informatik
Veröffentlichungsort: Mainz
ROR: https://ror.org/023b0x485
DOI: http://doi.org/10.25358/openscience-5853
Version: Published version
Publikationstyp: Zeitschriftenaufsatz
Nutzungsrechte: CC BY
Informationen zu den Nutzungsrechten: https://creativecommons.org/licenses/by/4.0/
Zeitschrift: Foundations of computational mathematics
20
Seitenzahl oder Artikelnummer: 1175
1236
Verlag: Springer
Verlagsort: New York, NY
Erscheinungsdatum: 2020
ISSN: 1615-3383
URL der Originalveröffentlichung: https://doi.org/10.1007/s10208-020-09446-z
DOI der Originalveröffentlichung: 10.1007/s10208-020-09446-z
Enthalten in den Sammlungen:JGU-Publikationen

Dateien zu dieser Ressource:
  Datei Beschreibung GrößeFormat
Miniaturbild
bachmayr_markus-stability_of_l-20210427134220691.pdf1.19 MBAdobe PDFÖffnen/Anzeigen