Journal article · 2016 · Open access

A Fast-marching Algorithm for Nonmonotonically Evolving Fronts

Alexandra Tcheng, Jean‐Christophe Nave

SIAM Journal on Scientific Computing, 38(4), A2307–A2333 · Published 1 January 2016 · DOI 10.1137/15m1017302

Free PDFView at the publisherCite this paper

In brief

“A Fast-marching Algorithm for Nonmonotonically Evolving Fronts” is a 2016 journal article by Alexandra Tcheng and Jean‐Christophe Nave, published in SIAM Journal on Scientific Computing. OpenAlex counts 0 citations as of 16 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
0
References
28
Authors
2

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.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Tcheng, A., & Nave, J. (2016). A Fast-marching Algorithm for Nonmonotonically Evolving Fronts. SIAM Journal on Scientific Computing, 38(4), A2307–A2333. https://doi.org/10.1137/15m1017302

MLA 9

Tcheng, Alexandra, and Jean‐Christophe Nave. “A Fast-marching Algorithm for Nonmonotonically Evolving Fronts.” SIAM Journal on Scientific Computing, vol. 38, no. 4, 2016, pp. A2307–A2333. https://doi.org/10.1137/15m1017302.

Chicago

Tcheng, Alexandra and Jean‐Christophe Nave. 2016. “A Fast-marching Algorithm for Nonmonotonically Evolving Fronts.” SIAM Journal on Scientific Computing 38 (4): A2307–A2333. https://doi.org/10.1137/15m1017302.

Harvard

Tcheng, A. and Nave, J. (2016) ‘A Fast-marching Algorithm for Nonmonotonically Evolving Fronts’, SIAM Journal on Scientific Computing, 38(4), pp. A2307–A2333. doi:10.1137/15m1017302.

IEEE

A. Tcheng and J. Nave, “A Fast-marching Algorithm for Nonmonotonically Evolving Fronts,” SIAM Journal on Scientific Computing, vol. 38, no. 4, pp. A2307–A2333, 2016, doi: 10.1137/15m1017302.

BibTeX

@article{tcheng2016fast,
  title     = {{A Fast-marching Algorithm for Nonmonotonically Evolving Fronts}},
  author    = {Tcheng, Alexandra and Nave, Jean‐Christophe},
  journal   = {SIAM Journal on Scientific Computing},
  year      = {2016},
  volume    = {38},
  number    = {4},
  pages     = {A2307--A2333},
  doi       = {10.1137/15m1017302},
  url       = {https://doi.org/10.1137/15m1017302}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Engineering › Computational Mechanics › Advanced Numerical Methods in Computational Mathematics

  • fast marching algorithm
  • level set equation
  • Hamilton-Jacobi equation
  • nonlinear advection
  • Dirichlet problem
  • zero level set
  • directed graphs
  • stability and convergence

Work with this paper

Most-cited papers in Engineering

All highly cited Engineering papers

Questions about this paper

How do I cite this paper in APA style?

Tcheng, A., & Nave, J. (2016). A Fast-marching Algorithm for Nonmonotonically Evolving Fronts. SIAM Journal on Scientific Computing, 38(4), A2307–A2333. https://doi.org/10.1137/15m1017302

How many times has this paper been cited?

0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at arXiv (Cornell University).

Who wrote this paper?

Alexandra Tcheng, Jean‐Christophe Nave.

What is the DOI of this paper?

10.1137/15m1017302. The permanent link is https://doi.org/10.1137/15m1017302.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.