Parallel implementations of the fast sweeping method
H Zhao - Journal of Computational Mathematics, 2007 - JSTOR
Journal of Computational Mathematics, 2007•JSTOR
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.
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.
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.
JSTOR以上显示的是最相近的搜索结果。 查看全部搜索结果