Year: 2007
Journal of Computational Mathematics, Vol. 25 (2007), Iss. 4 : pp. 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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2007-JCM-8701
Journal of Computational Mathematics, Vol. 25 (2007), Iss. 4 : pp. 421–429
Published online: 2007-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 9
Keywords: Hamilton-Jacobi equation Eikonal equation Characteristics viscosity solution Upwind difference Courant-Friedrichs-Levy (CFL) condition Gauss-Seidel iteration Domain decomposition.