5. Efficient Higher Order Time Discretization Schemes For Hamilton–Jacobi–Bellman Equations Based On Diagonally Implicit Symplectic Runge–Kutta Methods

From MaRDI portal
Publication:4557477












This page was built for publication: 5. Efficient Higher Order Time Discretization Schemes For Hamilton–Jacobi–Bellman Equations Based On Diagonally Implicit Symplectic Runge–Kutta Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557477)