
doi: 10.1155/2014/436362
handle: 10394/16719
Our concern in this paper is to use the homotopy decomposition method to solve the Hamilton-Jacobi-Bellman equation (HJB). The approach is obviously extremely well organized and is an influential procedure in obtaining the solutions of the equations. We portrayed particular compensations that this technique has over the prevailing approaches. We presented that the complexity of the homotopy decomposition method is of orderO(n). Furthermore, three explanatory examples established good outcomes and comparisons with exact solution.
QA1-939, Dynamic programming in optimal control and differential games, Numerical methods of relaxation type, Fractional partial differential equations, Mathematics
QA1-939, Dynamic programming in optimal control and differential games, Numerical methods of relaxation type, Fractional partial differential equations, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
