5. Efficient Higher Order Time Discretization Schemes For Hamilton–Jacobi–Bellman Equations Based On Diagonally Implicit Symplectic Runge–Kutta Methods (Q4557477)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 5. Efficient Higher Order Time Discretization Schemes For Hamilton–Jacobi–Bellman Equations Based On Diagonally Implicit Symplectic Runge–Kutta Methods |
scientific article; zbMATH DE number 6984490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 5. Efficient Higher Order Time Discretization Schemes For Hamilton–Jacobi–Bellman Equations Based On Diagonally Implicit Symplectic Runge–Kutta Methods |
scientific article; zbMATH DE number 6984490 |
Statements
5. Efficient Higher Order Time Discretization Schemes For Hamilton–Jacobi–Bellman Equations Based On Diagonally Implicit Symplectic Runge–Kutta Methods (English)
0 references
23 November 2018
0 references
optimal feedback control
0 references
Hamilton-Jacobi-Bellman equation
0 references
dynamic programming principle
0 references
Runge-Kutta composition methods
0 references
diagonally implicit symplectic Runge-Kutta methods
0 references
sparse grids
0 references
0 references
0.8707973
0 references
0.86261696
0 references
0.85730267
0 references
0.8570338
0 references
0.85616463
0 references
0.85586005
0 references
0.8557288
0 references
