arXiv (OAI Expanded)
open access
High-order robust basis-update & Galerkin integrators for dynamical low-rank approximation
Dynamical low-rank approximation has become a widely used numerical method in diverse disciplines. Its main idea is to represent the matrix or tensor-valued solution to a time-dependent differential equation as a low-rank factorization. The evolution of the factorization leads to highly stiff dynami
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- High-order robust basis-update & Galerkin integrators for dynamical low-rank approximation#781044
- Low rank approximation in G0W0 calculations#624327
- Bounds-Constrained Finite Element Approximation of Time-Dependent Partial Differential Equations#822334
- Numerical schemes for the solution of the damped wave equation -II *#246935
- Improved error estimates for low-regularity integrators using space-time bounds#141718
Record · ID 779669
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive