Revision as of 23:23, 31 May 2016 edit Dadaist6174 (talk \| contribs) Extended confirmed users 1,823 edits m →Algorithm ← Previous edit		Revision as of 17:14, 15 June 2016 edit undo Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,084 edits m clean up, replaced: Proc. Nat. Acad → Proc. Natl. Acad, removed stub tag using AWB Next edit →
Line 1: The '''fast marching method'''<ref name="sethian_fmm">J.A. Sethian. A Fast Marching Level Set Method for Monotonically Advancing Fronts, Proc. ~~Nat~~Natl. Acad. Sci., 93, 4, pp.1591--1595, 1996. [https://math.berkeley.edu/~sethian/2006/Papers/sethian.fastmarching.pdf]</ref> is a numerical method created by [[James Sethian]] for solving [[boundary value problem]]s of the [[Eikonal equation]]: : <math>\|\nabla u(x)\|=1/f(x) \text{ for } x \in \Omega</math> Line 54: [[Category:Numerical differential equations]] ~~{{mathapplied-stub}}~~

Fast marching method: Difference between revisions