Calculus of variations and optimal control; optimization Dynamic programming and Hamilton-Jacobi theory Concept
Hamilton–Jacobi theory of the calculus of variations
Summary
Hamilton–Jacobi theory links a problem of the calculus of variations with a single first-order partial differential equation, the Hamilton–Jacobi equation. A solution of this equation, such as the action along extremals, generates a whole family of extremals, a field of extremals. Conversely, a suitable family of solutions, a complete integral, gives all solutions of Hamilton's canonical equations by Jacobi's theorem. The theory gives sufficient conditions for minima and is the classical ancestor of dynamic programming.
Further reading
About this page
| Tag | 6JGM1K39FB |
|---|---|
| URI | m2://6JGM1K39FB |
| Kind | concept |
| Writing | W0 stub |
| MSC | 49L99, 70H20, 49K05 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.