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

一种用于一类二阶半线性方程的动态域分解方法

A dynamic domain decomposition for a class of second order semi-linear equations

Simone Cacace, Maurizio Falcone

AI总结:

本文提出一种并行算法,用于求解来自随机优化控制问题的二阶半线性方程,通过动态域分解技术扩展了之前用于确定性优化控制问题的一阶哈密尔顿-雅可比-贝尔曼方程的分块域分解方法。

摘要:

我们提出了一种并行算法,用于求解来自随机优化控制问题的一类二阶半线性方程,通过动态域分解技术。新方法是之前用于第一阶哈密尔顿-雅可比-贝尔曼方程的分块域分解方法的扩展。原始方法下的半拉格朗日方案被修改以处理(可能退化)的扩散,通过离散时间马尔可夫链近似方程相关的随机优化控制问题。我们证明,在适当的离散化参数条件下,并且在扩散系数足够小时,所提出的动态分解的并行计算比静态分解更快。为此,我们结合了并行化与快速推进法上下文中的已知技术。在二维中进行了若干数值测试,以展示所提出方法的特性。

英文摘要:

We propose a parallel algorithm for the numerical solution of a class of second order semi-linear equations coming from stochastic optimal control problems, by means of a dynamic domain decomposition technique. The new method is an extension of the patchy domain decomposition method presented in a previous work for first order Hamilton-Jacobi-Bellman equations related to deterministic optimal control problems. The semi-Lagrangian scheme underlying the original method is modified in order to deal with (possibly degenerate) diffusion, by approximating the stochastic optimal control problem associated to the equation via discrete time Markov chains. We show that under suitable conditions on the discretization parameters and for sufficiently small values of the diffusion coefficient, the parallel computation on the proposed dynamic decomposition is faster than that on a static decomposition. To this end, we combine the parallelization with some well known techniques in the context of fast-marching-like methods for first order Hamilton-Jacobi equations. Several numerical tests in dimension two are presented, in order to show the features of the proposed method.

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

↑