CoChat

Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors

Open access
Lubich, Christian, Rohwedder, Thorsten, Schneider, Reinhold, Vandereycken, Bart · 2013 · SIAM Journal on Matrix Analysis and Applications

The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.

Abstract

We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch and Lubich; see [SIAM J. Matrix Anal. Appl., 29 (2007), pp. 434--454], [SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2360--2375]) to the recently proposed hierarchical Tucker (HT) tensor format (Hackbusch and Kühn; see [J. Fourier Anal. Appl., 15 (2009), pp. 706--722]) and the tensor train (TT) format (Oseledets; see [SIAM J. Sci. Comput., 33 (2011), pp. 2295--2317]), which are closely related to tensor decomposition methods used in quantum physics and chemistry. In this dynamical approximation approach, the time derivative of the tensor to be approximated is projected onto the time-dependent tangent space of the approximation manifold along the solution trajectory. This approach can be used to approximate the solutions to tensor differential equations in the HT or TT format and to compute updates in optimization algorithms within these reduced tensor formats. By deriving and analyzing the tangent space projector for the manifold of HT/TT tensors of fixed rank, we obtain curvature estimates, which allow us to obtain quasi-best approximation properties for the dynamical approximation, showing that the prospects and limitations of the ansatz are similar to those of the dynamical low rank approximation for matrices. Our results are exemplified by numerical experiments.

Overview

Integrity signals

Registry

Crossref · 10.1137/120885723

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 31 references

Research works printed but not linked: 1

  1. G. W. Stewart, Matrix Algorithms: Vol. $1$, Basic Decompositions , SIAM, Philadelphia, 1998. · DOI

Cited by

See all 164

Metadata

Authors
Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B.
Venue
SIAM Journal on Matrix Analysis and Applications
Published
2013-01
Volume
34
Issue
2
Pages
470-494
ISSN
  • 0895-4798 (ISSN-L)
  • 1095-7162
OpenAlex
W2067067855
Cited by
163
References
31
Citations by year
2026: 8 · 2025: 8 · 2024: 17 · 2023: 14 · 2022: 16 · 2021: 14 · 2020: 13 · 2019: 13 · 2018: 9 · 2017: 7 · 2016: 9 · 2015: 12 · 2014: 13 · 2013: 8
FWCI
4.36
Type
journal article
Language
en
Open access
Locations
  • SIAM Journal on Matrix Analysis and Applications (publishedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
Topics
  • Physical Sciences › Mathematics › Computational Mathematics › Tensor decomposition and applications
  • Physical Sciences › Mathematics › Numerical Analysis › Numerical Solvers for Ordinary Differential Equations
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Model Reduction and Neural Networks
Keywords
tensor train format, dynamical low-rank approximation, curvature estimates, optimization algorithms

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors. https://app.cochat.ai/papers/10.1137/120885723
The paper
Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B. (2013). Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/120885723

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.