SIAM Journal on Scientific Computing · 2011 · 45 citations · 30 references
ComputingComputer SciencePhysicsFinite Element AnalysisFinite Element MethodsScientific ComputingConvergence AnalysisFinite Difference MethodsFinite Element DiscretizationNumerical AlgorithmsNumerical AnalysisNumerical Methods For Differential EquationsCausalityDiscontinuous Galerkin FormulationEikonal EquationFirst-order Difference EquationsHigher-order Finite ElementsImplicit CausalityOrder AccuracySweeping Algorithms
In [F. Li, C.-W. Shu, Y.-T. Zhang, H. Zhao, J. Comput. Phys., 227 (2008) pp. 8191–8208], we developed a fast sweeping method based on a hybrid local solver which is a combination of a discontinuous Galerkin (DG) finite element solver and a first order finite difference solver for Eikonal equations. The method has second order accuracy in the $L^1$ norm and a very fast convergence speed, but only first order accuracy in the $L^\infty$ norm for the general cases. This is an obstacle to the design of higher order DG fast sweeping methods. In this paper, we overcome this problem by developing uniformly accurate DG fast sweeping methods for solving Eikonal equations. We design novel causality indicators which guide the information flow directions for the DG local solver. The values of these indicators are initially provided by the first order finite difference fast sweeping method, and they are updated during iterations along with the solution. We observe both a uniform second order accuracy in the $L^\infty$ norm (in smooth regions) and the fast convergence speed (linear computational complexity) in the numerical examples.
30
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
A fast sweeping method for Eikonal equations
Hongkai Zhao · Mathematics of Computation · 2004 · 1.1K citations · Full text