English

Fast two-scale methods for Eikonal equations

Numerical Analysis 2011-10-31 v1

Abstract

Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on problems where the characteristics are largely straight lines. Fast Marching, on the other hand, is usually more efficient than Fast Sweeping on problems where characteristics frequently change their directions and on domains with complicated geometry. In this paper we explore the possibility of combining the best features of both of these approaches, by using marching on a coarser scale and sweeping on a finer scale. We present three new hybrid methods based on this idea and illustrate their properties on several numerical examples with continuous and piecewise-constant speed functions in R2R^2.

Cite

@article{arxiv.1110.6220,
  title  = {Fast two-scale methods for Eikonal equations},
  author = {Adam Chacon and Alexander Vladimirsky},
  journal= {arXiv preprint arXiv:1110.6220},
  year   = {2011}
}

Comments

35 pages; 12 figures; 14 tables. This is an expanded (& more comprehensive) version of a paper accepted for publication by SIAM Journal on Scientific Computing

R2 v1 2026-06-21T19:27:16.807Z