Year: 2016
Type: article
Abstract: The nonmonotonic propagation of fronts is considered. When the speed function $F:\mathbb{R}^{n} \times [0,T]\rightarrow \mathbb{R}$ is prescribed, the nonlinear advection equation $\phi_{t}+F|\nabla \phi|=0$ is a Hamilton--Jacobi equation known as the level-set equation. It is argued that a small enough neighborhood of the zero-level-set $\mathcal{M}$ of the solution $\phi: \mathbb{R}^{n} \times [0,T] \rightarrow \mathbb{R}$ is the graph of $\psi:\mathbb{R}^{n} \rightarrow \mathbb{R}$, where $\psi$ solves a Dirichlet problem of the form $H(\mathbf{u},\psi(\mathbf{u}),\nabla \psi(\mathbf{u}))=0$. A fast-marching algorithm is presented where each point is computed using a discretization of such a Dirichlet problem, with no restrictions on the sign of $F$. The output is a directed graph whose vertices evenly sample $\mathcal{M}$. The convergence, consistency, and stability of the scheme are addressed. Bounds on the computational complexity are estimated and experimentally shown to be on par with the fast-marching method. Examples are presented where the algorithm is shown to be globally first-order accurate. The complexities and accuracies observed are independent of the monotonicity of the evolution.
DOI: 10.1137/15m1017302
Authors: Alexandra Tcheng, Jean-Christophe Nave
Language: English
Subfield: Computational Mechanics
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1514899150
