Encyclopedia

Fast sweeping method

Wikipedia contributorsAdapted for Fathomly · View authors

1 min read
Source updated May 19, 2024

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}$ , $f(\mathbf {x} )$ is a function with positive values, $\partial \Omega$ is a well-behaved boundary of the open set and $|\cdot |$ is the Euclidean 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 the paper by Boue and Dupuis. 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.

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

Watch videos about Fast sweeping methodExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article “Fast sweeping method”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.

Fast sweeping method

Sources and credits

Related topics

Fast marching method