Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 301

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

Koch, Othmar, Lubich, Christian·2007·SIAM Journal on Matrix Analysis and Applications

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/050639703

Cites

8 of 8 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 8 references

Cited by

See all 301

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.