Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Preprints and Working Papers
  4. Robust high-order low-rank BUG integrators based on explicit Runge-Kutta methods
 
Loading...
Thumbnail Image
preprint

Robust high-order low-rank BUG integrators based on explicit Runge-Kutta methods

Nobile, Fabio  
•
Riffaud, Sébastien  
February 10, 2025

In this work, we propose high-order basis-update & Galerkin (BUG) integrators based on explicit Runge-Kutta methods for large-scale matrix differential equations. These dynamical low-rank integrators are high-order extensions of the BUG integrator and are constructed by performing one time-step of the first-order BUG integrator at each stage of the Runge-Kutta method. In this way, the resulting Runge-Kutta BUG integrator is robust to the presence of small singular values and does not involve backward time-integration steps. We provide an error bound, which shows that the Runge-Kutta BUG integrator retains the order of convergence of the associated Runge-Kutta method until the error reaches a plateau corresponding to the low-rank truncation and which vanishes as the rank increases. This error bound is finally validated numerically on three different test cases. The results demonstrate the high-order convergence of the Runge-Kutta BUG integrator and its superior accuracy compared to other low-rank integrators proposed in the literature.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

2502.07040v1.pdf

Type

Main Document

Access type

openaccess

License Condition

CC BY

Size

1.16 MB

Format

Adobe PDF

Checksum (MD5)

42625770bc70206ed14cefd36d7bf416

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés