CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique, Inria Saclay - Ile de France, UMA - Unité de Mathématiques Appliquées, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR7641
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
Contributeur : Hasnaa Zidani
<>
Soumis le : jeudi 22 octobre 2009 - 21:44:07
Dernière modification le : jeudi 12 avril 2018 - 01:46:36
Document(s) archivé(s) le : mercredi 22 septembre 2010 - 13:41:15
