Rate of convergence of difference approximations for uniformly nondegenerate elliptic Bellman's equations
N.V. Krylov

TL;DR
This paper establishes that finite-difference solutions for uniformly elliptic Bellman's equations in smooth domains converge at a rate of at least h^{2/3}, providing a quantitative measure of approximation accuracy.
Contribution
It proves a new lower bound on the convergence rate of finite-difference schemes for elliptic Bellman's equations in smooth bounded domains.
Findings
Convergence rate is at least h^{2/3} for finite-difference solutions.
Results apply to uniformly elliptic Bellman's equations in smooth domains.
Provides theoretical foundation for numerical approximation accuracy.
Abstract
We show that the rate of convergence of solutions of finite-difference approximations for uniformly elliptic Bellman's equations is of order at least , where is the mesh size. The equations are considered in smooth bounded domains.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Modeling in Engineering · Nonlinear Partial Differential Equations · advanced mathematical theories
