5. Efficient Higher Order Time Discretization Schemes For Hamilton–Jacobi–Bellman Equations Based On Diagonally Implicit Symplectic Runge–Kutta Methods
Hamilton-Jacobi-Bellman equationoptimal feedback controlsparse gridsdynamic programming principlediagonally implicit symplectic Runge-Kutta methodsRunge-Kutta composition methods
Dynamic programming (90C39) Optimality conditions for problems involving partial differential equations (49K20) Dynamic programming in optimal control and differential games (49L20) Discrete approximations in optimal control (49M25) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)
- Discrete time high-order schemes for viscosity solutions of Hamilton- Jacobi-Bellman equations
- Novel high-order energy-preserving diagonally implicit Runge-Kutta schemes for nonlinear Hamiltonian ODEs
- On higher-order semi-explicit symplectic partitioned Runge-Kutta methods for constrained Hamiltonian systems
- scientific article; zbMATH DE number 1282999
- Construction of convergent high order schemes for time dependent Hamilton-Jacobi equations
- Diagonal implicit symplectic extended RKN methods for solving oscillatory Hamiltonian systems
- Discontinuous Galerkin finite element methods for time-dependent Hamilton-Jacobi-Bellman equations with Cordes coefficients
- A sixth order diagonally implicit symmetric and symplectic Runge-Kutta method for solving Hamiltonian systems
- Exponentially accurate Hamiltonian embeddings of symplectic A-stable Runge-Kutta methods for Hamiltonian semilinear evolution equations
- Highly efficient invariant-conserving explicit Runge-Kutta schemes for nonlinear Hamiltonian differential equations
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)