REVIEW 3 cited by
Second-order robust parallel integrators for dynamical low-rank approximation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 3 Pith papers
-
An Augmented Backward-Corrected Projector Splitting Integrator for Dynamical Low-Rank Training
An augmented backward-corrected projector-splitting integrator (abc-PSI) trains rank-adaptive low-rank neural networks with one QR decomposition per step and a claimed convergence guarantee to locally optimal weights.
-
Automatic partitioning for the low-rank integration of stochastic Boolean reaction networks
A Kernighan-Lin plus information-entropy heuristic automatically partitions Boolean reaction networks for low-rank master equation integration, outperforming manual and cut-minimal partitions in tests on mTOR, pancrea...
-
A review of low-rank methods for time-dependent kinetic simulations
A comprehensive review of dynamical low-rank and step-and-truncate methods showing that many kinetic problems can be solved with drastically reduced memory and cost.
Discussion (0). Continue with ORCID to comment.