Journal article · 2016 · Open access

A Low Complexity Algorithm for Non-Monotonically Evolving Fronts

Alexandra Tcheng, Jean‐Christophe Nave

Journal of Scientific Computing, 69(3), 1165–1191 · Published 6 June 2016 · DOI 10.1007/s10915-016-0231-8

Free PDFView at the publisherCite this paper

In brief

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

Citations
2
Most cited in
2016 (1)
Field-weighted impact
0.23
References
60
Authors
2

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 Low Complexity Algorithm for Non-Monotonically Evolving Fronts. Journal of Scientific Computing, 69(3), 1165–1191. https://doi.org/10.1007/s10915-016-0231-8

MLA 9

Tcheng, Alexandra, and Jean‐Christophe Nave. “A Low Complexity Algorithm for Non-Monotonically Evolving Fronts.” Journal of Scientific Computing, vol. 69, no. 3, 2016, pp. 1165–1191. https://doi.org/10.1007/s10915-016-0231-8.

Chicago

Tcheng, Alexandra and Jean‐Christophe Nave. 2016. “A Low Complexity Algorithm for Non-Monotonically Evolving Fronts.” Journal of Scientific Computing 69 (3): 1165–1191. https://doi.org/10.1007/s10915-016-0231-8.

Harvard

Tcheng, A. and Nave, J. (2016) ‘A Low Complexity Algorithm for Non-Monotonically Evolving Fronts’, Journal of Scientific Computing, 69(3), pp. 1165–1191. doi:10.1007/s10915-016-0231-8.

IEEE

A. Tcheng and J. Nave, “A Low Complexity Algorithm for Non-Monotonically Evolving Fronts,” Journal of Scientific Computing, vol. 69, no. 3, pp. 1165–1191, 2016, doi: 10.1007/s10915-016-0231-8.

BibTeX

@article{tcheng2016complexity,
  title     = {{A Low Complexity Algorithm for Non-Monotonically Evolving Fronts}},
  author    = {Tcheng, Alexandra and Nave, Jean‐Christophe},
  journal   = {Journal of Scientific Computing},
  year      = {2016},
  volume    = {69},
  number    = {3},
  pages     = {1165--1191},
  doi       = {10.1007/s10915-016-0231-8},
  url       = {https://doi.org/10.1007/s10915-016-0231-8}
}

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

  • front propagation
  • level set method
  • fast marching method
  • low computational complexity
  • well-posedness
  • discretization
  • truncation error

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 Low Complexity Algorithm for Non-Monotonically Evolving Fronts. Journal of Scientific Computing, 69(3), 1165–1191. https://doi.org/10.1007/s10915-016-0231-8

How many times has this paper been cited?

2 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.1007/s10915-016-0231-8. The permanent link is https://doi.org/10.1007/s10915-016-0231-8.

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.