The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A projector-splitting integrator for dynamical low-rank approximation
Abstract
The dynamical low-rank approximation of time-dependent matrices is a low-rank factorization updating technique. It leads to differential equations for factors of the matrices, which need to be solved numerically. We propose and analyze a fully explicit, computationally inexpensive integrator that is based on splitting the orthogonal projector onto the tangent space of the low-rank manifold. As is shown by theory and illustrated by numerical experiments, the integrator enjoys robustness properties that are not shared by any standard numerical integrator. This robustness can be exploited to change the rank adaptively. Another application is in optimization algorithms for low-rank matrices where truncation back to the given low rank can be done efficiently by applying a step of the integrator proposed here.
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
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
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-citation
Cited by
A 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
Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
Dolgov, S. V., & Savostyanov, D. V. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/140953289 · Cited by 253
Time 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-citation
Metadata
- Authors
- Lubich, C., & Oseledets, I. V.
- Venue
- BIT Numerical Mathematics
- Published
- 2013-11-07
- Volume
- 54
- Issue
- 1
- Pages
- 171-188
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W2096434207
- Cited by
- 175
- References
- 2
- FWCI
- 8.72
- Type
- journal article
- Language
- en
- Open access
- closed
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: A projector-splitting integrator for dynamical low-rank approximation. https://app.cochat.ai/papers/10.1007/s10543-013-0454-0
- The paper
- Lubich, C., & Oseledets, I. V. (2014). A projector-splitting integrator for dynamical low-rank approximation. BIT Numerical Mathematics. https://doi.org/10.1007/s10543-013-0454-0
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.