Fast sweeping method: Difference between revisions

Revision as of 01:04, 12 October 2016

Revision as of 01:08, 12 October 2016

Line 1:

{{unreferenced|date=October 2016}}

Fast sweeping method is a numerical method for solving [[Boundary value problem|boundary value problems]] of the [[Eikonal equation]]:.

<math>|\nabla u(\mathbf{x})| = \dfrac{1}{f(\mathbf{x})} \text{ for } \mathbf{x} \in \Omega

Line 9:

</math>

Fast sweeping method is an iterative method which uses upwind difference for discretization and uses Gauss-Seidel iterations with alternating sweeping ordering to solve the discretized Eikonal equation on a rectangular grid. The origins of this approach lie in [[control theory]]. Although fast sweeping methods have existed in control theory, it was first proposed for Eikonal equations by Hongkai Zhao, an applied mathematician at the [[University of California, Irvine]].

<references />{{uncategorised|date=October 2016}}{{stub}}

{{uncategorised|date=October 2016}}{{stub}}

[[Category:Numerical differential equations]]

[[Category:Partial differential equations]]