Skip to search formSkip to main contentSkip to account menu

Fast sweeping method

In applied mathematics, the fast sweeping method is a numerical method for solving boundary value problems of the Eikonal equation. where is an open… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Fast methods are very popular algorithms to compute time-of-arrival maps (distance maps measured in time units) solving the… 
2013
2013
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and of the Fast Iterative Method… 
2009
2009
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very… 
2009
2009
In this work we provide a novel approach to homogenization for a class of static Hamilton–Jacobi (HJ) equations, which we call… 
Highly Cited
2007
Highly Cited
2007
快大规模方法是为夸张问题的一个有效反复的方法。它把 Gauss-Seidel 重复与轮流出现打扫订相结合。在这篇论文,快大规模方法的几平行实现被介绍。这些平行算法由于内在的部分不同方程的诱发性简单、有效。数字例子被用来验证我们的算法。数学题目分类:65N06… 
2007
2007
The fast sweeping method is an efficient iterative method for hyperbolic problems. It combines Gauss-Seidel iterations with… 
2001
2001
In view of the requirements for the new accelerator KUT-20, results of the preoperational test-bench development of…