Indexed metadata

Projection Methods for Dynamical Low-Rank Approximation of High-Dimensional Problems

Emil Kieri, Bart Vandereycken

Source record

Source: Crossref

Published: Jul 21, 2018

DOI: 10.1515/cmam-2018-0029

Open original source ↗

Source abstract

Abstract We consider dynamical low-rank approximation on the manifold of fixed-rank matrices and tensor trains (also called matrix product states), and analyse projection methods for the time integration of such problems. First, under suitable approximability assumptions, we prove error estimates for the explicit Euler method equipped with quasi-optimal projections to the manifold. Then we discuss the possibilities and difficulties with higher-order explicit methods. In particular, we discuss ways for limiting rank growth in the increments, and robustness with respect to small singular values.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Projection Methods for Dynamical Low-Rank Approximation of High-Dimensional Problems — Mathematical Frontier Network