Fast sweeping method: Difference between revisions

Content deleted Content added

Inline

Revision as of 23:57, 13 January 2017

In applied mathematics, the fast sweeping method is a numerical method for solving boundary value problems of the Eikonal equation.

|\nabla u(\mathbf {x} )|={\frac {1}{f(\mathbf {x} )}}{\text{ for }}\mathbf {x} \in \Omega

u(\mathbf {x} )=0{\text{ for }}\mathbf {x} \in \partial \Omega

where $\Omega$ is an open set in $\mathbb {R} ^{n}$ and $f(\mathbf {x} )$ is a function with positive values and $\partial \Omega$ is a well-behaved boundary of the open set and $|\cdot |$ is the $L^{2}$ norm.

The 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^[1] by Hongkai Zhao, an applied mathematician at the University of California, Irvine.

Sweeping algorithms are highly efficient for solving Eikonal equations when the corresponding characteristic curves do not change direction very often.^[2]

References

^ Zhao, Hongkai (2005-01-01). "A fast sweeping method for Eikonal equations". Mathematics of Computation. 74 (250): 603–627. doi:10.1090/S0025-5718-04-01678-3. ISSN 0025-5718.
^ A. Chacon and A. Vladimirsky. Fast two-scale methods for Eikonal equations. SIAM J. on Scientific Computing 34/2: A547-A578, 2012. [1]

@@ Line 9: / Line 9: @@
 where <math>\Omega </math> is an open set in <math>\mathbb{R}^n</math> and <math>f(\mathbf{x})</math> is a function with positive values and <math>\partial \Omega </math> is a well-behaved boundary of the open set and <math>|\cdot|</math> is the <math>L^2</math> norm.
-== Introduction ==
 The fast sweeping method is an iterative method which uses upwind difference for discretization and uses [[Gauss–Seidel method|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<ref>{{Cite journal|last=Zhao|first=Hongkai|date=2005-01-01|title=A fast sweeping method for Eikonal equations|url=http://www.ams.org/mcom/2005-74-250/S0025-5718-04-01678-3/|journal=Mathematics of Computation|volume=74|issue=250|pages=603–627|doi=10.1090/S0025-5718-04-01678-3|issn=0025-5718}}</ref> by Hongkai Zhao, an applied mathematician at the [[University of California, Irvine]].
+Sweeping algorithms are highly efficient for solving Eikonal equations when the corresponding [[Method of characteristics|characteristic curves]] do not change direction very often.<ref name="chacon_twoscale">A. Chacon and A. Vladimirsky. Fast two-scale methods for Eikonal equations. SIAM J. on Scientific Computing 34/2: A547-A578, 2012. [http://arxiv.org/abs/1110.6220]</ref>
 == References ==
 <references />
+== See also ==
+* [[Fast marching method]]
 [[Category:Numerical differential equations]]