The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Dynamical Low‐Rank Approximation
Abstract
For the low‐rank approximation of time‐dependent data matrices and of solutions to matrix differential equations, an increment‐based computational approach is proposed and analyzed. In this method, the derivative is projected onto the tangent space of the manifold of rank‐r matrices at the current approximation. With an appropriate decomposition of rank‐r matrices and their tangent matrices, this yields nonlinear differential equations that are well suited for numerical integration. The error analysis compares the result with the pointwise best approximation in the Frobenius norm. It is shown that the approach gives locally quasi‐optimal low‐rank approximations. Numerical experiments illustrate the theoretical results.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Note on Exchange Phenomena in the Thomas Atom
Dirac, P. A. M. (1930) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100016108 · Cited by 3,302
Geometric Numerical Integration
(2006) · Springer Series in Computational Mathematics · doi:10.1007/3-540-30666-8 · Cited by 3,118
Beck, M. (2000) · Physics Reports · doi:10.1016/s0370-1573(99)00047-2 · Cited by 2,462
Using Linear Algebra for Intelligent Information Retrieval
Berry, M. W., Dumais, S. T., & O’Brien, G. W. (1995) · SIAM Review · doi:10.1137/1037127 · Cited by 1,481
Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
Simon, H. D., & Hongyuan Zha, B. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827597327309 · Cited by 137
On variational approximations in quantum molecular dynamics
Lubich, C. (2004) · Mathematics of Computation · doi:10.1090/s0025-5718-04-01685-0 · Cited by 55
Self-citationOn the Low-Rank Approximation of Data on the Unit Sphere
Chu, M. T., Buono, N. D., Lopez, L., & Politi, T. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479803433295 · Cited by 19
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
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-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-citation
Metadata
- Authors
- Koch, O., & Lubich, C.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2007-01
- Volume
- 29
- Issue
- 2
- Pages
- 434-454
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2152279941
- Cited by
- 301
- References
- 8
- FWCI
- 5.00
- 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: Dynamical Low‐Rank Approximation. https://app.cochat.ai/papers/10.1137/050639703
- The paper
- Koch, O., & Lubich, C. (2007). Dynamical Low‐Rank Approximation. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/050639703
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.