Robust second-order time integration of tree tensor networks
From MaRDI portal
Multilinear algebra, tensor calculus (15A69) Numerical methods for initial value problems involving ordinary differential equations (65L05) Stability and convergence of numerical methods for ordinary differential equations (65L20) Error bounds for numerical methods for ordinary differential equations (65L70)
Cites work
- A parallel Basis Update and Galerkin Integrator for Tree Tensor Networks
- A parallel rank-adaptive integrator for dynamical low-rank approximation
- A projector-splitting integrator for dynamical low-rank approximation
- A rank-adaptive robust integrator for dynamical low-rank approximation
- A robust second-order low-rank BUG integrator based on the midpoint rule
- Discretized dynamical low-rank approximation in the presence of small singular values
- Dynamical Low‐Rank Approximation
- Dynamical Tensor Approximation
- From quantum to classical molecular dynamics: Reduced models and numerical analysis.
- High-order robust basis-update & Galerkin integrators for dynamical low-rank approximation
- Matrix product state representations
- On the stability of robust dynamical low-rank approximations for hyperbolic problems
- Rank-adaptive time integration of tree tensor networks
- Robust high-order low-rank BUG integrators based on explicit Runge--Kutta methods
- Second-order robust parallel integrators for dynamical low-rank approximation
- Some mathematical notes on three-mode factor analysis
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
- Tensor-train decomposition
- Time integration of rank-constrained Tucker tensors
- Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors
- Time integration of tree tensor networks
- Tree-based tensor formats
This page was built for publication: Robust second-order time integration of tree tensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7388574)