Skip to main content
Springer Nature Link
Log in

L 1-minimization methods for Hamilton–Jacobi equations: the one-dimensional case

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Abstract

A new approximation technique based on L 1-minimization is introduced. It is proven that the approximate solution converges to the viscosity solution in the case of one-dimensional stationary Hamilton–Jacobi equation with convex Hamiltonian.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Abgrall, R.: Numerical discretization of the first-order Hamilton–Jacobi equation on triangular meshes. Comm. Pure Appl. Math. 49(12), 1339–1373 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  3. Candes, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inform. Theory 51(12), 4203–4215 (2005)

    Article  MathSciNet  Google Scholar 

  4. Chambolle, A., Lions, P.-L.: Image recovery via total variation minimization and related problems. Numer. Math. 76(2), 167–188 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chan, T.F., Esedoḡlu, S.: Aspects of total variation regularized L 1 function approximation. SIAM J. Appl. Math. 65(5), 1817–1837 (electronic) (2005)

  6. Crandall, M.G., Lions, P.-L.: Two approximations of solutions of Hamilton–Jacobi equations. Math. Comp. 43(167), 1–19 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  7. Evans, L.C.: Partial Differential Equations, volume 19 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI (1998)

    Google Scholar 

  8. Guermond, J.L.: A finite element technique for solving first-order PDEs in L P. SIAM J. Numer. Anal. 42(2), 714–737 (electronic) (2004)

  9. Guermond, J.-L., Marpeau, F., Popov, B.: A fast algorithm for solving first order 1D PDEs by L 1-minimization (2007), submitted

  10. Guermond, J.-.L., Popov, B.: Linear advection with ill-posed boundary conditions via L 1 minimization. Int. J. Numer. Anal. Model. 4(1), 39–47 (2007)

    MATH  MathSciNet  Google Scholar 

  11. Guermond, J.-L., Popov, B.: L 1-minimization methods for Hamilton–Jacobi equations. SIAM J. Numer. Anal. (2007), submitted

  12. Jiang, B.-N.: Nonoscillatory and nondiffusive solution of convection problems by the iteratively reweighted least-squares finite element method. J. Comput. Phys. 105(1), 108–121 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  14. Kružkov, S.N.: Generalized solutions of Hamilton–Jacobi equations of eikonal type. I. Statement of the problems; existence, uniqueness and stability theorems; certain properties of the solutions. Mat. Sb. (N.S.) 98(140)(3(11)), 450–493, 496 (1975)

  15. Lavery, J.E.: Solution of steady-state one-dimensional conservation laws by mathematical programming. SIAM J. Numer. Anal. 26(5), 1081–1089 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lavery, J.E.: Solution of steady-state, two-dimensional conservation laws by mathematical programming. SIAM J. Numer. Anal. 28(1), 141–155 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lions, P.-L., Souganidis, P.E.: Convergence of MUSCL and filtered schemes for scalar conservation laws and Hamilton–Jacobi equations. Numer. Math. 69(4), 441–470 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  18. Osher, S., Fedkiw, R.: Level Set Methods and Dynamic Implicit Surfaces, volume 153 of Applied Mathematical Sciences. Springer, New York (2003)

    Google Scholar 

  19. Osher, S., Shu, C.-W.: High-order essentially nonoscillatory schemes for Hamilton–Jacobi equations. SIAM J. Numer. Anal. 28(4), 907–922 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  20. Rudin, L., Osher, S., Fatemi, C.: Nonlinear total variation based noise removal algorithms. Physica D 60, 259–268 (1992)

    Article  MATH  Google Scholar 

  21. Sethian, J.A.: Fast marching methods. SIAM Rev. 41(2), 199–235 (electronic) (1999)

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Texas A&M University, 3368 TAMU, College Station, TX, 77843, USA

    Jean-Luc Guermond & Bojan Popov

Authors
  1. Jean-Luc Guermond
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Bojan Popov
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jean-Luc Guermond.

Additional information

This material is based upon work supported by the National Science Foundation grant DMS-0510650.

J.-L. Guermond is on leave from LIMSI, UPRR 3251 CNRS, BP 133, 91403 Orsay Cedex, France.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guermond, JL., Popov, B. L 1-minimization methods for Hamilton–Jacobi equations: the one-dimensional case. Numer. Math. 109, 269–284 (2008). https://doi.org/10.1007/s00211-008-0142-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00211-008-0142-1

Mathematics Subject Classification (2000)