Ordered upwind methods for static Hamilton-Jacobi equations: Theory and algorithms

被引:271
作者
Sethian, JA [1 ]
Vladimirsky, A
机构
[1] Univ Calif Berkeley, Dept Math, Berkeley, CA 94720 USA
[2] Cornell Univ, Dept Math, Ithaca, NY 14853 USA
关键词
ordered upwind methods; fast marching methods; Dijkstra-like methods; anisotropic optimal control; dynamic programming; viscosity solution; anisotropic front propagation;
D O I
10.1137/S0036142901392742
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We develop a family of fast methods for approximating the solutions to a wide class of static Hamilton-Jacobi PDEs; these fast methods include both semi-Lagrangian and fully Eulerian versions. Numerical solutions to these problems are typically obtained by solving large systems of coupled nonlinear discretized equations. Our techniques, which we refer to as "Ordered Upwind Methods" (OUMs), use partial information about the characteristic directions to decouple these nonlinear systems, greatly reducing the computational labor. Our techniques are considered in the context of control-theoretic and front-propagation problems. We begin by discussing existing OUMs, focusing on those designed for isotropic problems. We then introduce a new class of OUMs which decouple systems for general ( anisotropic) problems. We prove convergence of one such scheme to the viscosity solution of the corresponding Hamilton-Jacobi PDE. Next, we introduce a set of finite-differences methods based on an analysis of the role played by anisotropy in the context of front propagation and optimal trajectory problems. The performance of the methods is analyzed, and computational experiments are performed using test problems from computational geometry and seismology.
引用
收藏
页码:325 / 363
页数:39
相关论文
共 46 条
[1]   A FAST LEVEL SET METHOD FOR PROPAGATING INTERFACES [J].
ADALSTEINSSON, D ;
SETHIAN, JA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1995, 118 (02) :269-277
[2]   The fast construction of extension velocities in level set methods [J].
Adalsteinsson, D ;
Sethian, JA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1999, 148 (01) :2-22
[3]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[4]  
[Anonymous], APPL MATH OPT
[5]  
BARDI M, 1994, ANN INT SOC DYN GAME, P89
[6]  
Bellman R., 1957, DYNAMIC PROGRAMMING
[7]  
Bellman R, 1967, INTRO MATH THEORY CO
[8]   SOME PROPERTIES OF VISCOSITY SOLUTIONS OF HAMILTON-JACOBI EQUATIONS [J].
CRANDALL, MG ;
EVANS, LC ;
LIONS, PL .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1984, 282 (02) :487-502
[9]   VISCOSITY SOLUTIONS OF HAMILTON-JACOBI EQUATIONS [J].
CRANDALL, MG ;
LIONS, PL .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1983, 277 (01) :1-42
[10]  
Dellinger J.A., 1991, THESIS STANFORD U ST