An efficient data structure to solve front propagation problems - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue Journal of Scientific Computing Année : 2010

An efficient data structure to solve front propagation problems

Résumé

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.
Fichier principal
Vignette du fichier
Bok-Cri-Zid.pdf (1.06 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00273977 , version 1 (16-04-2008)
inria-00273977 , version 2 (22-10-2009)

Identifiants

Citer

Olivier Bokanowski, Emiliano Cristiani, Hasnaa Zidani. An efficient data structure to solve front propagation problems. Journal of Scientific Computing, 2010, 42 (2), pp.251--273. ⟨10.1007/s10915-009-9329-6⟩. ⟨inria-00273977v2⟩
290 Consultations
405 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More