The geometry of algorithms using hierarchical tensors
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
In this paper, the differential geometry of the novel hierarchical Tucker format for tensors is derived. The set HT,k of tensors with fixed tree T and hierarchical rank k is shown to be a smooth quotient manifold, namely the set of orbits of a Lie group action corresponding to the non-unique basis representation of these hierarchical tensors. Explicit characterizations of the quotient manifold, its tangent space and the tangent space of HT,k are derived, suitable for high-dimensional problems. The usefulness of a complete geometric description is demonstrated by two typical applications. First, new convergence results for the nonlinear Gauss-Seidel method on HT, k are given. Notably and in contrast to earlier works on this subject, the task of minimizing the Rayleigh quotient is also addressed. Second, evolution equations for dynamic tensor approximation are formulated in terms of an explicit projection operator onto the tangent space of HT,k. In addition, a numerical comparison is made between this dynamical approach and the standard one based on truncated singular value decompositions. © 2013 Elsevier Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The density-matrix renormalization group
Schollwöck, U. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.259 · Cited by 3,323 · cited 1×
“, [18–21].”
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
From Quantum to Classical Molecular Dynamics: Reduced Models and Numerical Analysis
Lubich, C. (2008) · Zurich Lectures in Advanced Mathematics · doi:10.4171/067 · Cited by 366 · cited 1×
“A smooth manifold structure underlies this analysis; see also [34] for related methods.”
MethodApproximation of $2^d\times2^d$ Matrices Using Tensor Decomposition
Oseledets, I. V. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090757861 · Cited by 174
Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120885723 · Cited by 163 · cited 2×
“For a theoretical and numerical investigation of such an approximation, we refer to [48, 70].”
BackgroundSelf-citationGeometry of matrix product states: Metric, parallel transport, and curvature
Haegeman, J., Mariën, M., Osborne, T. J., & Verstraete, F. (2014) · Journal of Mathematical Physics · doi:10.1063/1.4862851 · Cited by 86 · cited 1×
“Also, a generalization to Hilbert spaces is possible; see [73,49,74].”
Background
Cited by
Cichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
Unifying time evolution and optimization with matrix product states
Haegeman, J., Lubich, C., Oseledets, I., Vandereycken, B., & Verstraete, F. (2016) · Physical Review B · doi:10.1103/physrevb.94.165116 · Cited by 804
Self-citationA literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
Low-rank tensor completion by Riemannian optimization
Kressner, D., Steinlechner, M., & Vandereycken, B. (2014) · BIT Numerical Mathematics · doi:10.1007/s10543-013-0455-z · Cited by 290
Self-citationTime Integration of Tensor Trains
Lubich, C., Oseledets, I. V., & Vandereycken, B. (2015) · SIAM Journal on Numerical Analysis · doi:10.1137/140976546 · Cited by 183
Self-citationDynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120885723 · Cited by 163
Self-citationGeometry of matrix product states: Metric, parallel transport, and curvature
Haegeman, J., Mariën, M., Osborne, T. J., & Verstraete, F. (2014) · Journal of Mathematical Physics · doi:10.1063/1.4862851 · Cited by 86
Parallel time-dependent variational principle algorithm for matrix product states
Secular, P., Gourianov, N., Lubasch, M., Dolgov, S., Clark, S. R., & Jaksch, D. (2020) · Physical Review B · doi:10.1103/physrevb.101.235123 · Cited by 40
“[90–92]), Haegeman et al.”
Metadata
- Authors
- Uschmajew, A., & Vandereycken, B.
- Venue
- Linear Algebra and its Applications
- Publisher
- Elsevier BV
- Published
- 2013-07
- Volume
- 439
- Issue
- 1
- Pages
- 133-166
- ISSN
- 0024-3795 (ISSN-L)
- OpenAlex
- W2133512121
- Cited by
- 111
- References
- 6
- FWCI
- 3.86
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.