Overlapping Domain Decomposition Methods for Noncoercive Hamilton-Jacobi-Bellman Equation
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i2.6070Keywords:
Hamilton-Jacobi-Bellman equation, noncoercive problems, overlapping domain decomposition, convergence analysis, lower and upper solutions, finite difference methodAbstract
This study presents an approach to demonstrate the monotonic and geometric convergence of the non-coercive Hamilton-Jacobi-Bellman problem with Dirichlet boundary conditions using the finite difference method. The approach combines overlapping domain decomposition with a sequence of lower and upper solutions to characterize the solution in a discrete setting. Numerical experiments are conducted to validate the methodology and illustrate the consistency of the theoretical findings.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Samar Chebbah , Mohamed Haiour, Sofiane Madi

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.