Abstract
We provide a unified strategy to show that solutions of dynamic programming principles associated to the -Laplacian converge to the solution of the corresponding Dirichlet problem. Our approach includes all previously known cases for continuous and discrete dynamic programming principles, provides new results, and gives a convergence proof free of probability arguments.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.