Second-order robust parallel integrators for dynamical low-rank approximation

Abstract Due to its reduced memory and computational demands, dynamical low-rank approximation (DLRA) has sparked significant interest in multiple research communities. A central challenge in DLRA is the development of time integrators that are robust to the curvature of the manifold of low-rank matrices. Recently, a parallel robust time integrator that permits dynamic rank adaptation and enables a fully parallel update of all low-rank factors was introduced. Despite its favorable computational efficiency, the construction as a first-order approximation to the augmented basis-update & Galerkin integrator restricts the parallel integrator’s accuracy to order one. In this work, an extension to higher order is proposed by a careful basis augmentation before solving the matrix differential equations of the factorized solution. A robust error bound with an improved dependence on normal components of the vector field together with a norm preservation property up to small terms is derived. These analytic results are complemented and demonstrated through a series of numerical experiments.

Authors

Institutions

Publication Details

Journal
BIT Numerical Mathematics
Published
2025-06-16
DOI
https://doi.org/10.1007/s10543-025-01073-w
Citations
8
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
10.68

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Second-order robust parallel integrators for dynamical low-rank approximation

Jonas Kusch
8 citations
BIT Numerical Mathematics
Sparse and Compressive Sensing Techniques
10.68
article

Second-order robust parallel integrators for dynamical low-rank approximation

Jonas Kusch
article en
8 citations

Abstract

Abstract Due to its reduced memory and computational demands, dynamical low-rank approximation (DLRA) has sparked significant interest in multiple research communities. A central challenge in DLRA is the development of time integrators that are robust to the curvature of the manifold of low-rank matrices. Recently, a parallel robust time integrator that permits dynamic rank adaptation and enables a fully parallel update of all low-rank factors was introduced. Despite its favorable computational efficiency, the construction as a first-order approximation to the augmented basis-update & Galerkin integrator restricts the parallel integrator’s accuracy to order one. In this work, an extension to higher order is proposed by a careful basis augmentation before solving the matrix differential equations of the factorized solution. A robust error bound with an improved dependence on normal components of the vector field together with a norm preservation property up to small terms is derived. These analytic results are complemented and demonstrated through a series of numerical experiments.

BIT Numerical MathematicsVol. 65(3)
Norwegian University of Life Sciences (NO)
Norges Miljø- og Biovitenskapelige Universitet
Openalex Percentile: Top 1%
Sparse and Compressive Sensing Techniques
10.68
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Second-order robust parallel integrators for dynamical low-rank approximation — Jonas Kusch · BIT Numerical Mathematics (2025) | TGRS Research Map | TGRS