Skip to main content
SpringerLink
Log in

Fast Sweeping Methods for Factored Anisotropic Eikonal Equations: Multiplicative and Additive Factors

  • Published:
Journal of Scientific Computing Aims and scope Submit manuscript

Abstract

The viscosity solution of static Hamilton-Jacobi equations with a point-source condition has an upwind singularity at the source, which makes all formally high-order finite-difference scheme exhibit first-order convergence and relatively large errors. To obtain designed high-order accuracy, one needs to treat this source singularity during computation. In this paper, we apply the factorization idea to numerically compute viscosity solutions of anisotropic eikonal equations with a point-source condition. The idea is to factor the unknown traveltime function into two functions, either additively or multiplicatively. One of these two functions is specified to capture the source singularity so that the other function is differentiable in a neighborhood of the source. Then we design monotone fast sweeping schemes to solve the resulting factored anisotropic eikonal equation. Numerical examples show that the resulting monotone schemes indeed yield clean first-order convergence rather than polluted first-order convergence and both factorizations are able to treat the source singularity successfully.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barles, G., Souganidis, P.E.: Convergence of approximation schemes for fully nonlinear second order equations. Asymptot. Anal. 4, 271–283 (1991)

    MathSciNet  MATH  Google Scholar 

  2. Boué, M., Dupuis, P.: Markov chain approximations for deterministic control problems with affine dynamics and quadratic cost in the control. SIAM J. Numer. Anal. 36(3), 667–695 (1999)

    Article  MathSciNet  Google Scholar 

  3. Cecil, T., Osher, S.J., Qian, J.: Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension. J. Comput. Phys. 213, 458–473 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fomel, S., Luo, S., Zhao, H.-K.: Fast sweeping method for the factored eikonal equations. J. Comput. Phys. 228(17), 6440–6445 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Helmsen, J., Puckett, E., Colella, P., Dorr, M.: Two new methods for simulating photolithography development in 3d. Proc. SPIE 2726, 253–261 (1996)

    Article  Google Scholar 

  6. Kao, C., Osher, S., Qian, J.: Lax-Friedrichs sweeping schemes for static Hamilton-Jacobi equations. J. Comput. Phys. 196, 367–391 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kao, C., Osher, S., Tsai, Y.: Fast sweeping method for static Hamilton-Jacobi equations. SIAM J. Numer. Anal. 42, 2612–2632 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kao, C., Osher, S., Qian, J.: Legendre transform based fast sweeping methods for static Hamilton-Jacobi equations on triangulated meshes. J. Comput. Phys. 227, 10209–10225 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Leung, S., Qian, J.: An adjoint state method for three-dimensional transmission traveltime tomography using first-arrivals. Commun. Math. Sci. 4, 249–266 (2006)

    MathSciNet  MATH  Google Scholar 

  10. Li, F., Shu, C.-W., Zhang, Y.-T., Zhao, H.-K.: A second-order discontinuous Galerkin fast sweeping method for eikonal equations. J. Comput. Phys. 227, 8191–8208 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Luo, S.: Numerical methods for static Hamilton-Jacobi equations. Ph.D Thesis, University of California, Irvine (2009)

  12. Luo, S., Qian, J.: Factored singularities and high-order Lax-Friedrichs sweeping schemes for point-source traveltimes and amplitudes. J. Comput. Phys. 230, 4742–4755 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Luo, S., Leung, S., Qian, J.: An adjoint state method for numerical approximation of continuous traffic congestion equilibria. Commun. Comput. Phys. 10, 1113–1131 (2011)

    MathSciNet  Google Scholar 

  14. Pica, A.: Fast and accurate finite-difference solutions of the 3D eikonal equation parametrized in celerity. In: 67th Ann. Internat. Mtg, Soc. of Expl. Geophys, pp. 1774–1777 (1997)

    Google Scholar 

  15. Qian, J., Symes, W.W.: Paraxial eikonal solvers for anisotropic quasi-P traveltimes. J. Comput. Phys. 173, 1–23 (2001)

    Article  MathSciNet  Google Scholar 

  16. Qian, J., Symes, W.W.: Adaptive finite difference method for traveltime and amplitude. Geophysics 67, 167–176 (2002)

    Google Scholar 

  17. Qian, J., Symes, W.W.: Finite-difference quasi-P traveltimes for anisotropic media. Geophysics 67, 147–155 (2002)

    Google Scholar 

  18. Qian, J., Zhang, Y.-T., Zhao, H.-K.: A fast sweeping methods for static convex Hamilton-Jacobi equations. J. Sci. Comput. 31(1/2), 237–271 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  19. Qian, J., Zhang, Y.-T., Zhao, H.-K.: Fast sweeping methods for eiknonal equations on triangulated meshes. SIAM J. Numer. Anal. 45, 83–107 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  20. Rouy, E., Tourin, A.: A viscosity solutions approach to shape-from-shading. SIAM J. Numer. Anal. 29, 867–884 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  21. Tsai, Y., Cheng, L.-T., Osher, S., Zhao, H.-K.: Fast sweeping algorithms for a class of Hamilton-Jacobi equations. SIAM J. Numer. Anal. 41, 673–694 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control 40, 1528–1538 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Zhang, L., Rector, J.W., Hoversten, G.M.: Eikonal solver in the celerity domain. Geophys. J. Int. 162, 1–8 (2005)

    Article  Google Scholar 

  24. Zhang, Y.-T., Zhao, H.-K., Qian, J.: High order fast sweeping methods for static Hamilton-Jacobi equations. J. Sci. Comput. 29, 25–56 (2006)

    Article  MathSciNet  Google Scholar 

  25. Zhao, H.-K.: A fast sweeping method for eikonal equations. Math. Comput. 74, 603–627 (2005)

    MATH  Google Scholar 

  26. Zhao, H.-K.: Parallel implementations of the fast sweeping method. J. Comput. Math. 25, 421–429 (2007)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Michigan State University, East Lansing, MI, 48824, USA

    Songting Luo & Jianliang Qian

Authors
  1. Songting Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianliang Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianliang Qian.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luo, S., Qian, J. Fast Sweeping Methods for Factored Anisotropic Eikonal Equations: Multiplicative and Additive Factors. J Sci Comput 52, 360–382 (2012). https://doi.org/10.1007/s10915-011-9550-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10915-011-9550-y

Keywords

Search

Navigation