PORTO @ 
Archivio Istituzionale della Ricerca
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThe Howard’s algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for itshigh efficiency and good performances. A useful characteristic of the method is the superlinear convergence which, in presenceof a finite number of controls, is reached in finite time. Performances of the method can be significantly improved using parallelcomputing. Building a parallel version of the method is not trivial because of the hyperbolic nature of the problem. In this paperwe propose a parallel version of the Howard’s algorithm driven by an idea of domain decomposition. This permits to derive someimportant properties and to prove the convergence under standard assumptions. The good features of the algorithm are shownthrough some tests and examples.
Domain decomposition based parallel Howard's algorithm / Festa, Adriano. - In: MATHEMATICS AND COMPUTERS IN SIMULATION. - ISSN 1872-7166. - 147(2018), pp. 121-139. [10.1016/j.matcom.2017.04.008]
| Titolo: | Domain decomposition based parallel Howard's algorithm | |
| Autori: | ||
| Data di pubblicazione: | 2018 | |
| Rivista: | ||
| Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.matcom.2017.04.008 | |
| Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| 18_Festa_MathComp.pdf | 2a Post-print versione editoriale / Version of Record | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia | |
| Howard_Preprint_mascot.pdf | 2. Post-print / Author's Accepted Manuscript |  | Visibile a tuttiVisualizza/Apri |
http://hdl.handle.net/11583/2786531
Copyright © 2021