A previous knowledge of the domains of dependence of a Hamilton-Jacobi equation can be useful in its study and approximation. Information of this nature is, in general, difficult to obtain directly from the data of the problem. In this paper we formally introduce the concept of an independent sub-domain, discuss its main properties and provide a constructive implicit representation formula. Through these results, we propose an algorithm for the approximation of these sets that is shown to be relevant in the numerical resolution, via parallel computing.

Reconstruction of independent sub-domains for a class of Hamilton-Jacobi equations and application to parallel computing

Festa, Adriano
2016

Abstract

A previous knowledge of the domains of dependence of a Hamilton-Jacobi equation can be useful in its study and approximation. Information of this nature is, in general, difficult to obtain directly from the data of the problem. In this paper we formally introduce the concept of an independent sub-domain, discuss its main properties and provide a constructive implicit representation formula. Through these results, we propose an algorithm for the approximation of these sets that is shown to be relevant in the numerical resolution, via parallel computing.
File in questo prodotto:
File Dimensione Formato  
1405.3521.pdf

accesso aperto

Tipologia: Documento in Post-print
Licenza: Dominio pubblico
Dimensione 549.82 kB
Formato Adobe PDF
549.82 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11697/134377
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 7
social impact