...
首页> 外文期刊>Journal of Scientific Computing >A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations
【24h】

A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations

机译:Hamilton-Jacobi方程单调前传播模型的快速行进方法

获取原文
获取原文并翻译 | 示例

摘要

In this paper we present a generalization of the Fast Marching method introduced by J.A. Sethian in 1996 to solve numerically the eikonal equation. The new method, named Buffered Fast Marching (BFM), is based on a semi-Lagrangian discretization and is suitable for Hamilton-Jacobi equations modeling monotonically advancing fronts, including Hamilton-Jacobi-Bellman and Hamilton-Jacobi-Isaacs equations which arise in the framework of optimal control problems and differential games. We also show the convergence of the algorithm to the viscosity solution. Finally we present several numerical tests comparing the BFM method with other existing methods.
机译:在本文中,我们介绍了J.A.介绍的快速行进方法的一般化。塞思安(Sethian)于1996年以数值方式求解了本征方程。该新方法名为Buffered Fast Marching(BFM),它基于半拉格朗日离散化,适用于对单调前进前沿进行建模的Hamilton-Jacobi方程,包括汉密尔顿-Jacobi-Bellman和Hamilton-Jacobi-Isaacs方程。最优控制问题和微分博弈的框架。我们还展示了算法对粘度解的收敛性。最后,我们提出了一些数值测试,将BFM方法与其他现有方法进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号