Fast marching method: Difference between revisions

Revision as of 04:07, 22 August 2023

Latest revision as of 10:42, 26 October 2024

Line 24:

==Algorithm==

First, assume that the ___domain has been discretized into a mesh. We will refer to meshpointsmesh points as nodes. Each node <math>x_i</math> has a corresponding value <math>U_i = U(x_i) \approx u(x_i)</math>.

The algorithm works just like Dijkstra's algorithm but differs in how the nodes' values are calculated. In Dijkstra's algorithm, a node's value is calculated using a single one of the neighboring nodes. However, in solving the [[Partial differential equation|PDE]] in <math>\mathbb{R}^n</math>, between <math>1</math> and <math>n</math> of the neighboring nodes [[Eikonal equation#Numerical Approximation|are used]].