Fast two-scale methods for Eikonal equations
Adam Chacon, Alexander Vladimirsky

TL;DR
This paper introduces three hybrid two-scale methods that combine Fast Marching and Fast Sweeping techniques to efficiently solve the Eikonal equation across diverse problem types.
Contribution
The paper proposes novel hybrid algorithms that leverage the strengths of both Fast Marching and Fast Sweeping methods for improved efficiency.
Findings
Hybrid methods outperform individual approaches on various test problems.
The methods are effective for continuous and piecewise-constant speed functions.
Numerical examples demonstrate improved computational performance.
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Differential Equations and Numerical Methods · Iterative Methods for Nonlinear Equations
