pith. sign in

arxiv: 1503.05864 · v2 · pith:3FKNSX45new · submitted 2015-03-19 · 🧮 math.NA

Piecewise Constant Policy Approximations to Hamilton-Jacobi-Bellman Equations

classification 🧮 math.NA
keywords differentequationslinearusedconstantconvergencehamilton-jacobi-bellmaninterpolation
0
0 comments X p. Extension
pith:3FKNSX45 Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{3FKNSX45}

Prints a linked pith:3FKNSX45 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

An advantageous feature of piecewise constant policy timestepping for Hamilton-Jacobi-Bellman (HJB) equations is that different linear approximation schemes, and indeed different meshes, can be used for the resulting linear equations for different control parameters. Standard convergence analysis suggests that monotone (i.e., linear) interpolation must be used to transfer data between meshes. Using the equivalence to a switching system and an adaptation of the usual arguments based on consistency, stability and monotonicity, we show that if limited, potentially higher order interpolation is used for the mesh transfer, convergence is guaranteed. We provide numerical tests for the mean-variance optimal investment problem and the uncertain volatility option pricing model, and compare the results to published test cases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.