Abstract : In this paper we develop a general efficient sparse storage technique suitable to coding front evolutions in d>= 2 space dimensions. This technique is mainly applied here to deal with deterministic target problems with constraints, and solve the associated minimal time problems. To this end we consider an Hamilton-Jacobi-Bellman equation and use an adapted anti-diffusive Ultra-Bee scheme. We obtain a general method which is faster than a full storage technique. We show that we can compute problems that are out of reach by full storage techniques (because of memory). Numerical experiments are provided in dimension d=2,3,4.
https://hal.inria.fr/inria-00273977
Contributor : Hasnaa Zidani
<>
Submitted on : Thursday, October 22, 2009 - 9:44:07 PM
Last modification on : Monday, September 30, 2019 - 10:46:02 AM
Long-term archiving on : Wednesday, September 22, 2010 - 1:41:15 PM
