The Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A useful characteristic of the method is the superlinear convergence which, in presence of a finite number of controls, is reached in finite time. Performances of the method can be significantly improved using parallel computing. Building a parallel version of the method is not trivial because of the hyperbolic nature of the problem. In this paper we propose a parallel version of the Howard's algorithm driven by an idea of domain decomposition. This permits to derive some important properties and to prove the convergence under standard assumptions. The good features of the algorithm are shown through some tests and examples.
|Titolo:||Domain decomposition based parallel Howard's algorithm|
FESTA, Adriano [Membro del Collaboration Group] (Corresponding)
|Data di pubblicazione:||2018|
|Appare nelle tipologie:||1.1 Articolo in rivista|