2010
DOI: 10.1137/090749645
|View full text |Cite
|
Sign up to set email alerts
|

Some Improvements for the Fast Sweeping Method

Abstract: In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapidly. The conventional wisdom is that fast sweeping works best when the speed changes slowly, and fast marching is the algorithm of choice when the speed changes rapidly. The goal here is to achieve run times for the fast sweeping method that are at least as fast, or faster, than competitive methods, e.g. fast marching, in the case wh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
43
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 50 publications
(43 citation statements)
references
References 27 publications
0
43
0
Order By: Relevance
“…The computed solution for levels 13 and 18 grids are shown in Figure 5. 4. Experiments indicate that refining the grid along the sinusoidal layer boundaries does not improve accuracy significantly.…”
Section: Nonuniform Gridmentioning
confidence: 99%
See 2 more Smart Citations
“…The computed solution for levels 13 and 18 grids are shown in Figure 5. 4. Experiments indicate that refining the grid along the sinusoidal layer boundaries does not improve accuracy significantly.…”
Section: Nonuniform Gridmentioning
confidence: 99%
“…There are also a number of sweeping algorithms which use dynamic node orderings; for example [20,6,4]. These algorithms attempt to approximate the optimal ordering generated by single-pass methods such as FMM without the overhead associated with managing an accurate queue.…”
Section: Computational Gridmentioning
confidence: 99%
See 1 more Smart Citation
“…2003; Zhao 2004). The implementation of FSM is thus significantly simplified and its computational efficiency is superior to FMM even when velocity changes rapidly (Bak et al . 2010).…”
Section: Introductionmentioning
confidence: 99%
“…FSM advances wave fronts with iterative sweeping and updates traveltime at each grid point monotonically to ensure the causality (Tsai et al 2003;Zhao 2004). The implementation of FSM is thus significantly simplified and its computational efficiency is superior to FMM even when velocity changes rapidly (Bak et al 2010). In addition, FSM can be easily extended to high-order accuracy (Zhang et al 2006;Xiong et al 2010), achieve high computational performance on shared or distributed memory systems (Zhao 2007) and can be implemented on unstructured elements as well (Qian et al 2007).…”
Section: Introductionmentioning
confidence: 99%