Parallel Implementations of the Fast Sweeping Method

Authors

  • Hongkai Zhao

Keywords:

Hamilton-Jacobi equation, Eikonal equation, Characteristics, viscosity solution, Upwind difference, Courant-Friedrichs-Levy (CFL) condition, Gauss-Seidel iteration, Domain decomposition.

Abstract

The fast sweeping method is an efficient iterative method for hyperbolic problems. It combines Gauss-Seidel iterations with alternating sweeping orderings. In this paper several parallel implementations of the fast sweeping method are presented. These parallel algorithms are simple and efficient due to the causality of the underlying partial different equations. Numerical examples are used to verify our algorithms.

Downloads

Published

2007-08-02

Abstract View

  • 33171

Pdf View

  • 3550

Issue

Vol. 25 No. 4 (2007)

Section

Articles

How to Cite

Parallel Implementations of the Fast Sweeping Method. (2007). Journal of Computational Mathematics, 25(4), 421-429. https://www.global-sci.com/index.php/JCM/article/view/11836