eduzhai > Physical Sciences > Physics Sciences >

Dynamic Programming with Hermite Interpolation

  • Save

... pages left unread,continue reading

Document pages: 28 pages

Abstract: Numerical dynamic programming algorithms typically use Lagrange data to approximate value functions. This paper uses Hermite data obtained from the optimization step and applies Hermite interpolation to construct approximate value functions. Several examples show that Hermite interpolation significantly improves the accuracy of value function iteration with very little extra cost.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×