Comparison Principle for a Generalized Fast Marching Method
نویسندگان
چکیده
منابع مشابه
Comparison Principle for a Generalized Fast Marching Method
In [4], the authors have proposed a generalization of the classical Fast Marching Method of Sethian for the eikonal equation in the case where the normal velocity depends on space and time and can change sign. The goal of this paper is to propose a modified version of the Generalized Fast Marching Method proposed in [4] for which we state a general comparison principle. We also prove the conver...
متن کاملA Generalized Fast Marching Method for Dislocation Dynamics
In this paper, we consider a Generalized Fast Marching Method (GFMM) as a numerical method to compute dislocation dynamics. The dynamics of a dislocation hyper-surface in R (with N = 2 for physical applications) is given by its normal velocity which is a non-local function of the whole shape of the hyper-surface itself. For this dynamics, we show a convergence result of the GFMM as the mesh siz...
متن کاملFast Marching Trees: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT*). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملFast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT∗). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملConvergence of a Generalized Fast Marching Method for a non-convex eikonal equation
We present a new Fast Marching algorithm for a non-convex eikonal equation modeling front evolutions in the normal direction. The algorithm is an extension of the Fast Marching Method since the new scheme can deal with a time-dependent velocity without any restriction on its sign. We analyze the properties of the algorithm and we prove its convergence in the class of discontinuous viscosity sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2009
ISSN: 0036-1429,1095-7170
DOI: 10.1137/080718991