Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE

Details Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE

2002-08-30

arxiv.org/abs/math/0208240v1

Mathematics

Optimization and Control

115 pages, 9 figures, PhD dissertation

Scientific paper

We present methods for locally solving the Dynamic Programming Equations (DPE) and the Hamilton Jacobi Bellman (HJB) PDE that arise in the infinite horizon optimal control problem. The method for solving the DPE is the discrete time version of Al'brecht's procedure for locally approximating the solution of the HJB. We also prove the existence of the smooth solutions to the DPE that has the same Taylor series expansions as the formal solutions. Our procedure for solving the HJB PDE numerically begins with Al'brecht's local solution as the initial approximation and uses some Lyapunov criteria to piece together polynomial estimates. The polynomials are generated using the method in the Cauchy-Kovalevskaya Theorem.

Affiliated with

Also associated with

No associations

Rating

Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-252306