arrow
Volume 25, Issue 4
Parallel Implementations of the Fast Sweeping Method

Hongkai Zhao

J. Comp. Math., 25 (2007), pp. 421-429.

Published online: 2007-08

Export citation
  • 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.

  • AMS Subject Headings

65N06, 65N12, 65N55.

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-25-421, author = {}, title = {Parallel Implementations of the Fast Sweeping Method}, journal = {Journal of Computational Mathematics}, year = {2007}, volume = {25}, number = {4}, pages = {421--429}, 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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8701.html} }
TY - JOUR T1 - Parallel Implementations of the Fast Sweeping Method JO - Journal of Computational Mathematics VL - 4 SP - 421 EP - 429 PY - 2007 DA - 2007/08 SN - 25 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8701.html KW - Hamilton-Jacobi equation, Eikonal equation, Characteristics, viscosity solution, Upwind difference, Courant-Friedrichs-Levy (CFL) condition, Gauss-Seidel iteration, Domain decomposition. AB -

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.

Hongkai Zhao. (1970). Parallel Implementations of the Fast Sweeping Method. Journal of Computational Mathematics. 25 (4). 421-429. doi:
Copy to clipboard
The citation has been copied to your clipboard