...
首页> 外文期刊>Journal of Scientific Computing >An Ordered Upwind Method with Precomputed Stencil and Monotone Node Acceptance for Solving Static Convex Hamilton-Jacobi Equations
【24h】

An Ordered Upwind Method with Precomputed Stencil and Monotone Node Acceptance for Solving Static Convex Hamilton-Jacobi Equations

机译:求解静态凸Hamilton-Jacobi方程的带预计算模版和单调节点接受的有序迎风方法

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

摘要

We define a δ-causal discretization of static convex Hamilton-Jacobi Partial Differential Equations (HJ PDEs) such that the solution value at a grid node is dependent only on solution values that are smaller by at least S. We develop a Monotone Acceptance Ordered Upwind Method (MAOUM) that first determines a consistent, δ-causal stencil for each grid node and then solves the discrete equation in a single-pass through the nodes. MAOUM is suited to solving HJ PDEs efficiently on highly-nonuniform grids, since the stencil size adjusts to the level of grid refinement. MAOUM is a Dijkstra-like algorithm that computes the solution in increasing value order by using a heap to sort proposed node values. If δ>0, MAOUM can be converted to a Dial-like algorithm that sorts and accepts values using buckets of width S. We present three hierarchical criteria for δ-causality of a node value update from a simplex of nodes in the stencil. The asymptotic complexity of MAOUM is found to be O(ψ>p)~d N log N), where d is the dimension, ψ is a measure of anisotropy in the equation, and p is a measure of the degree of nonuniformity in the grid. This complexity is a constant factor (ψ p)~d greater than that of the Dijkstra-like Fast Marching Method, but MAOUM solves a much more general class of static HJ PDEs. Although p factors into the asymptotic complexity, experiments demonstrate that grid nonuniformity does not have a large effect on the computational cost of MAOUM in practice. Our experiments indicate that, due to the stencil initialization overhead, MAOUM performs similarly or slightly worse than the comparable Ordered Upwind Method presented in (Sethian and Vladimirsky, SIAM J. Numer. Anal. 41:323, 2003) for two examples on uniform meshes, but considerably better for an example with rectangular speed profile and significant grid refinement around nonsmooth parts of the solution. We test MAOUM on a diverse set of examples, including seismic wavefront propagation and robotic navigation with wind and obstacles.
机译:我们定义了静态凸汉密尔顿-雅各比偏微分方程(HJ PDE)的δ因果离散化,使得网格节点处的解值仅取决于至少小S的解值。我们开发了单调接受有序上风方法(MAOUM),它首先为每个网格节点确定一个一致的δ因果模版,然后以单次通过这些节点的方式求解离散方程。 MAOUM适用于在高度不均匀的网格上高效求解HJ PDE,因为模板大小会根据网格细化程度进行调整。 MAOUM是一种类似于Dijkstra的算法,通过使用堆对建议的节点值进行排序,以递增的值顺序计算解决方案。如果δ> 0,则可以将MAOUM转换为类似Dial的算法,该算法使用宽度为S的存储桶对值进行排序并接受值。我们针对从模板中的节点单纯形得出的节点值更新的δ因果关系提出了三种分层标准。发现MAOUM的渐近复杂度为O(ψ> p)〜d N log N),其中d是维,ψ是方程中各向异性的度量,而p是度量方程中不均匀程度的度量。网格。这种复杂性比类似Dijkstra的快速行进方法的常数大(ψp)〜d,但是MAOUM解决了静态HJ PDE的更为通用的类别。尽管p会导致渐进复杂性,但实验表明,网格不均匀性在实际中对MAOUM的计算成本没有太大影响。我们的实验表明,由于模板初始化的开销,MAOUM在均匀网格上的两个示例的性能与在(Sethian和Vladimirsky,SIAM J. Numer。Anal。41:323,2003)中提出的可比的有序逆风方法相似或稍差。 ,但对于具有矩形速度曲线并在解决方案的非平滑部分周围进行显着网格优化的示例而言,要好得多。我们以各种示例测试MAOUM,包括地震波前传播以及带有风和障碍物的机器人导航。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号