Fast sweeping method

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1224577321 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

1 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.