80 citations · 173 across the 18 of their papers we have counts for
5 papers · 1 filter
Corner cases, singularities, and dynamic factoring
Dongping Qi, Alexander Vladimirsky
In Eikonal equations, rarefaction is a common phenomenon known to degrade the rate of convergence of numerical methods. The `factoring' approach alleviates this difficulty by deriv…
Causal Domain Restriction for Eikonal Equations
Zachary Clawson, Adam Chacon, Alexander Vladimirsky
Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations. Several…
A fast implicit method for time-dependent Hamilton-Jacobi PDEs
Alexander Vladimirsky, Changxi Zheng
We present a new efficient computational approach for time-dependent first-order Hamilton-Jacobi-Bellman PDEs. Since our method is based on a time-implicit Eulerian discretization,…
A parallel Heap-Cell Method for Eikonal equations
Adam Chacon, Alexander Vladimirsky
Numerous applications of Eikonal equations prompted the development of many efficient numerical algorithms. The Heap-Cell Method (HCM) is a recent serial two-scale technique that h…
Fast two-scale methods for Eikonal equations
Adam Chacon, Alexander Vladimirsky
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sw…