arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.5044math.NAcs.NA
收藏

基于域分解的并行Howard算法

Domain decomposition based parallel Howard's algorithm

École Nationale Supérieure de Techniques Avancées(国立高等先进技术学院);ENSTA ParisTech(巴黎高等国立应用科技学院)

Adriano Festa

AI总结:

本文提出基于域分解的并行Howard算法,用于解决离散Hamilton-Jacobi方程,通过并行计算提升性能,证明收敛性并展示测试结果。

摘要:

经典Howard算法是一种用于求解离散Hamilton-Jacobi方程的技术,因其高效性和良好性能在应用中被广泛使用。该方法的一个特别有益的特点是超线性收敛性,在有限控制的情况下可在有限时间内达到。通过并行计算可以显著提升该方法的性能;如何构建并行版本并非易事,困难来自解的不同值之间的严格关系,甚至与域中远处点相关。在本文中,我们提出了一种基于域分解思想的Howard算法并行版本。这使得能够推导出一些重要性质,并在相当标准的假设下证明收敛性。该算法的良好特性将通过一些测试和示例来展示。

英文摘要:

The Classic 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 special beneficial 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 by using parallel computing; how to build a parallel version of method is not a trivial point, the difficulties come from the strict relation between various values of the solution, even related to distant points of the domain. In this contribution 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 quite standard assumptions. The good features of the algorithm will be shown through some tests and examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑