Lesson plan

Fast sweeping method

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.

Back to article

Article summary

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.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.