Abstract
This article presents a new method for explicitly computing solutions to a HamiltonJacobi partial differential equation for which initial, boundary and internal conditions are prescribed as piecewise affine functions. Based on viability theory, a LaxHopf formula is used to construct analytical solutions for the individual contribution of each affine condition to the solution of the problem. The results are assembled into a LaxHopf algorithm which can be used to compute the solution to the partial differential equation at any arbitrary time at no other cost than evaluating a semi-analytical expression numerically. The method being semi-analytical, it performs at machine accuracy (compared to the discretization error inherent to finite difference schemes). The performance of the method is assessed with benchmark analytical examples. The running time of the algorithm is compared with the running time of a Godunov scheme.
Original language | English (US) |
---|---|
Article number | 5461008 |
Pages (from-to) | 1158-1174 |
Number of pages | 17 |
Journal | IEEE Transactions on Automatic Control |
Volume | 55 |
Issue number | 5 |
DOIs | |
State | Published - May 2010 |
Externally published | Yes |
Bibliographical note
Funding Information:Manuscript received June 17, 2008; revised April 12, 2009. Current version published May 12, 2010. This work was supported in part by VIMADES. Recommended by Associate Editor D. Dochain.
Keywords
- Hamilton-Jacobi (HJ)
- Initial conditions (ICs)
- Lax-Hopf formula
- Partial differential equation (PDE)
- Piecewise affine (PWA)
- Terminal conditions (TCs)
ASJC Scopus subject areas
- Control and Systems Engineering
- Computer Science Applications
- Electrical and Electronic Engineering