Matrix computations (3rd ed.)
Solving partial differential equations by collocation using radial basis functions
Applied Mathematics and Computation
Solving Hamilton-Jacobi-Bellman equations by a modified method of characteristics
Nonlinear Analysis: Theory, Methods & Applications - Lakshmikantham's Legacy: A tribute on his 75th birthday
Numerical Solution of Hamilton-Jacobi-Bellman Equations by an Upwind Finite Volume Method
Journal of Global Optimization
Radial Basis Functions
On application of an alternating direction method to Hamilton-Jacobin-Bellman equations
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on boundary and interior layers - computational and asymptotic methods (BAIL 2002)
Least squares collocation solution of elliptic problems in general regions
Mathematics and Computers in Simulation - Special issue: Applied and computational mathematics - selected papers of the fifth PanAmerican workshop - June 21-25, 2004, Tegucigalpa, Honduras
An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization
Journal of Global Optimization
Adaptive radial basis function methods for time dependent partial differential equations
Applied Numerical Mathematics
Adaptive multiquadric collocation for boundary layer problems
Journal of Computational and Applied Mathematics
Journal of Global Optimization
A radial basis collocation method for Hamilton-Jacobi-Bellman equations
Automatica (Journal of IFAC)
An adaptive domain decomposition method for the Hamilton---Jacobi---Bellman equation
Journal of Global Optimization
Hi-index | 0.00 |
We present a novel numerical method for the Hamilton---Jacobi---Bellman equation governing a class of optimal feedback control problems. The spatial discretization is based on a least-squares collocation Radial Basis Function method and the time discretization is the backward Euler finite difference. A stability analysis is performed for the discretization method. An adaptive algorithm is proposed so that at each time step, the approximate solution can be constructed recursively and optimally. Numerical results are presented to demonstrate the efficiency and accuracy of the method.