Hamilton-Jacobi Equations

Research Depth 94 in the knowledge graph I know this Set as goal
pde hamilton-jacobi optimal-control viscosity characteristics

Core Idea

Hamilton-Jacobi (HJ) equations are first-order nonlinear PDEs of the form u_t + H(x, ∇u) = 0, where H is the Hamiltonian. They arise in classical mechanics (Hamilton-Jacobi theory connects the action principle to wave-like evolution), optimal control (the value function satisfies an HJ equation), and geometric optics (wavefront propagation). Classical solutions typically break down in finite time as characteristics cross, and viscosity solutions provide the correct framework for global-in-time solutions. The Hopf-Lax formula gives an explicit representation for convex Hamiltonians.

Explainer

Hamilton-Jacobi equations sit at the intersection of classical mechanics, optimal control, and PDE theory. In mechanics, the Hamilton-Jacobi equation u_t + H(x, ∇u) = 0 describes the evolution of the action function, and its characteristics are the trajectories of Hamilton's equations (the equations of motion). Solving the HJ equation is equivalent to finding all trajectories simultaneously—a powerful reformulation that transforms particle mechanics into wave mechanics and lies at the historical foundation of quantum mechanics.

In optimal control, the value function V(x,t) measuring the minimum cost to reach a target from state x at time t satisfies the Hamilton-Jacobi-Bellman (HJB) equation. The Hamiltonian H(x,p) encodes the optimization: H(x,p) = min_a{f(x,a)·p + L(x,a)}, where f is the dynamics and L is the running cost. The optimal control is recovered from ∇V via the minimizing argument in H. This connection, formalized by Bellman's dynamic programming principle, makes HJ equations central to robotics, economics, and engineering.

Classical solutions of HJ equations break down because characteristics cross. For the equation u_t + ½|∇u|² = 0 with initial data u₀(x) = -|x|, the characteristics emanating from the origin fan out while those from far away converge, and the solution develops a corner (non-differentiable point) in finite time. The viscosity solution framework resolves this: it selects the physically correct solution by requiring that the equation is satisfied in an appropriate limiting sense. The Hopf-Lax formula u(x,t) = min_y{u₀(y) + tL((x-y)/t)} provides an explicit representation for convex Hamiltonians.

The eikonal equation |∇u| = f(x), the stationary HJ equation, describes wavefront propagation in geometric optics. The solution is the arrival time of a wavefront moving with speed 1/f(x). Its viscosity solution can be computed efficiently by the Fast Marching Method (O(N log N)), making it practical for applications in computational geometry, image segmentation, and path planning. The theory of HJ equations continues to develop: weak KAM theory (Fathi) connects HJ equations to dynamical systems and ergodic theory, while mean-field games couple HJ equations with Fokker-Planck equations to model large populations of interacting rational agents.

Practice Questions 4 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIterated Integrals and Fubini's TheoremDouble Integrals in Cartesian CoordinatesDouble Integrals over Rectangular RegionsDouble Integrals in Polar CoordinatesDouble Integrals: Definition and SetupIterated Integrals and Fubini's TheoremDouble Integrals over Rectangular RegionsDouble Integrals over General RegionsApplications of Double Integrals: Area, Mass, and MomentsTriple Integrals in Cartesian CoordinatesTriple Integrals in Cylindrical and Spherical CoordinatesChange of Variables and the Jacobian DeterminantApplications of Triple Integrals: Volume and MassVector Fields and Their RepresentationsLine Integrals of Vector FieldsGreen's TheoremSurface Integrals and Flux of Vector FieldsSurface Integrals and Flux of Vector FieldsDivergence Theorem: Flux and OutflowDivergence TheoremGreen's Functions for PDEsFundamental SolutionsDistribution Theory and Generalized FunctionsSobolev Spaces for PDEsWeak Solutions (Rigorous Theory)Lax-Milgram TheoremVariational Methods for PDEsCalculus of Variations and Euler-Lagrange EquationsHamilton-Jacobi Equations

Longest path: 95 steps · 499 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.