Two Numerical Methods for the elliptic Monge-Ampère equation

Jean-David Benamou; Brittany D. Froese; Adam M. Oberman

ESAIM: Mathematical Modelling and Numerical Analysis (2010)

  • Volume: 44, Issue: 4, page 737-758
  • ISSN: 0764-583X

Abstract

top
The numerical solution of the elliptic Monge-Ampère Partial Differential Equation has been a subject of increasing interest recently [Glowinski, in 6th International Congress on Industrial and Applied Mathematics, ICIAM 07, Invited Lectures (2009) 155–192; Oliker and Prussner, Numer. Math.54 (1988) 271–293; Oberman, Discrete Contin. Dyn. Syst. Ser. B10 (2008) 221–238; Dean and Glowinski, in Partial differential equations, Comput. Methods Appl. Sci. 16 (2008) 43–63; Glowinski et al., Japan J. Indust. Appl. Math.25 (2008) 1–63; Dean and Glowinski, Electron. Trans. Numer. Anal.22 (2006) 71–96; Dean and Glowinski, Comput. Methods Appl. Mech. Engrg.195 (2006) 1344–1386; Dean et al., in Control and boundary analysis, Lect. Notes Pure Appl. Math. 240 (2005) 1–27; Feng and Neilan, SIAM J. Numer. Anal.47 (2009) 1226–1250; Feng and Neilan, J. Sci. Comput.38 (2009) 74–98; Feng and Neilan, http://arxiv.org/abs/0712.1240v1; G. Loeper and F. Rapetti, C. R. Math. Acad. Sci. Paris340 (2005) 319–324]. There are already two methods available [Oliker and Prussner, Numer. Math.54 (1988) 271–293; Oberman, Discrete Contin. Dyn. Syst. Ser. B10 (2008) 221–238] which converge even for singular solutions. However, many of the newly proposed methods lack numerical evidence of convergence on singular solutions, or are known to break down in this case. In this article we present and study the performance of two methods. The first method, which is simply the natural finite difference discretization of the equation, is demonstrated to be the best performing method (in terms of convergence and solution time) currently available for generic (possibly singular) problems, in particular when the right hand side touches zero. The second method, which involves the iterative solution of a Poisson equation involving the Hessian of the solution, is demonstrated to be the best performing (in terms of solution time) when the solution is regular, which occurs when the right hand side is strictly positive.

How to cite

top

Benamou, Jean-David, Froese, Brittany D., and Oberman, Adam M.. "Two Numerical Methods for the elliptic Monge-Ampère equation." ESAIM: Mathematical Modelling and Numerical Analysis 44.4 (2010): 737-758. <http://eudml.org/doc/250759>.

@article{Benamou2010,
abstract = { The numerical solution of the elliptic Monge-Ampère Partial Differential Equation has been a subject of increasing interest recently [Glowinski, in 6th International Congress on Industrial and Applied Mathematics, ICIAM 07, Invited Lectures (2009) 155–192; Oliker and Prussner, Numer. Math.54 (1988) 271–293; Oberman, Discrete Contin. Dyn. Syst. Ser. B10 (2008) 221–238; Dean and Glowinski, in Partial differential equations, Comput. Methods Appl. Sci. 16 (2008) 43–63; Glowinski et al., Japan J. Indust. Appl. Math.25 (2008) 1–63; Dean and Glowinski, Electron. Trans. Numer. Anal.22 (2006) 71–96; Dean and Glowinski, Comput. Methods Appl. Mech. Engrg.195 (2006) 1344–1386; Dean et al., in Control and boundary analysis, Lect. Notes Pure Appl. Math. 240 (2005) 1–27; Feng and Neilan, SIAM J. Numer. Anal.47 (2009) 1226–1250; Feng and Neilan, J. Sci. Comput.38 (2009) 74–98; Feng and Neilan, http://arxiv.org/abs/0712.1240v1; G. Loeper and F. Rapetti, C. R. Math. Acad. Sci. Paris340 (2005) 319–324]. There are already two methods available [Oliker and Prussner, Numer. Math.54 (1988) 271–293; Oberman, Discrete Contin. Dyn. Syst. Ser. B10 (2008) 221–238] which converge even for singular solutions. However, many of the newly proposed methods lack numerical evidence of convergence on singular solutions, or are known to break down in this case. In this article we present and study the performance of two methods. The first method, which is simply the natural finite difference discretization of the equation, is demonstrated to be the best performing method (in terms of convergence and solution time) currently available for generic (possibly singular) problems, in particular when the right hand side touches zero. The second method, which involves the iterative solution of a Poisson equation involving the Hessian of the solution, is demonstrated to be the best performing (in terms of solution time) when the solution is regular, which occurs when the right hand side is strictly positive. },
author = {Benamou, Jean-David, Froese, Brittany D., Oberman, Adam M.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis},
keywords = {Finite difference schemes; partial differential equations; viscosity solutions; Monge-Ampère equation; finite difference schemes},
language = {eng},
month = {6},
number = {4},
pages = {737-758},
publisher = {EDP Sciences},
title = {Two Numerical Methods for the elliptic Monge-Ampère equation},
url = {http://eudml.org/doc/250759},
volume = {44},
year = {2010},
}

TY - JOUR
AU - Benamou, Jean-David
AU - Froese, Brittany D.
AU - Oberman, Adam M.
TI - Two Numerical Methods for the elliptic Monge-Ampère equation
JO - ESAIM: Mathematical Modelling and Numerical Analysis
DA - 2010/6//
PB - EDP Sciences
VL - 44
IS - 4
SP - 737
EP - 758
AB - The numerical solution of the elliptic Monge-Ampère Partial Differential Equation has been a subject of increasing interest recently [Glowinski, in 6th International Congress on Industrial and Applied Mathematics, ICIAM 07, Invited Lectures (2009) 155–192; Oliker and Prussner, Numer. Math.54 (1988) 271–293; Oberman, Discrete Contin. Dyn. Syst. Ser. B10 (2008) 221–238; Dean and Glowinski, in Partial differential equations, Comput. Methods Appl. Sci. 16 (2008) 43–63; Glowinski et al., Japan J. Indust. Appl. Math.25 (2008) 1–63; Dean and Glowinski, Electron. Trans. Numer. Anal.22 (2006) 71–96; Dean and Glowinski, Comput. Methods Appl. Mech. Engrg.195 (2006) 1344–1386; Dean et al., in Control and boundary analysis, Lect. Notes Pure Appl. Math. 240 (2005) 1–27; Feng and Neilan, SIAM J. Numer. Anal.47 (2009) 1226–1250; Feng and Neilan, J. Sci. Comput.38 (2009) 74–98; Feng and Neilan, http://arxiv.org/abs/0712.1240v1; G. Loeper and F. Rapetti, C. R. Math. Acad. Sci. Paris340 (2005) 319–324]. There are already two methods available [Oliker and Prussner, Numer. Math.54 (1988) 271–293; Oberman, Discrete Contin. Dyn. Syst. Ser. B10 (2008) 221–238] which converge even for singular solutions. However, many of the newly proposed methods lack numerical evidence of convergence on singular solutions, or are known to break down in this case. In this article we present and study the performance of two methods. The first method, which is simply the natural finite difference discretization of the equation, is demonstrated to be the best performing method (in terms of convergence and solution time) currently available for generic (possibly singular) problems, in particular when the right hand side touches zero. The second method, which involves the iterative solution of a Poisson equation involving the Hessian of the solution, is demonstrated to be the best performing (in terms of solution time) when the solution is regular, which occurs when the right hand side is strictly positive.
LA - eng
KW - Finite difference schemes; partial differential equations; viscosity solutions; Monge-Ampère equation; finite difference schemes
UR - http://eudml.org/doc/250759
ER -

References

top
  1. I. Bakelman, Convex analysis and nonlinear geometric elliptic equations. Springer-Verlag, Germany (1994).  Zbl0815.35001
  2. G. Barles and P.E. Souganidis, Convergence of approximation schemes for fully nonlinear second order equations. Asymptotic Anal.4 (1991) 271–283.  Zbl0729.65077
  3. K. Böhmer, On finite element methods for fully nonlinear elliptic equations of second order. SIAM J. Numer. Anal.46 (2008) 1212–1249.  Zbl1166.35322
  4. L.A. Caffarelli and M. Milman, Eds., Monge Ampère equation: applications to geometry and optimization, Contemporary Mathematics226. American Mathematical Society, Providence, USA (1999).  
  5. L. Caffarelli, L. Nirenberg and J. Spruck, The Dirichlet problem for nonlinear second-order elliptic equations. I. Monge-Ampère equation. Comm. Pure Appl. Math.37 (1984) 369–402.  Zbl0598.35047
  6. M.G. Crandall, H. Ishii and P.-L. Lions, User's guide to viscosity solutions of second order partial differential equations. Bull. Amer. Math. Soc. (N.S.)27 (1992) 1–67.  Zbl0755.35015
  7. E.J. Dean and R. Glowinski, An augmented Lagrangian approach to the numerical solution of the Dirichlet problem for the elliptic Monge-Ampère equation in two dimensions. Electron. Trans. Numer. Anal.22 (2006) 71–96.  Zbl1112.65119
  8. E.J. Dean and R. Glowinski, Numerical methods for fully nonlinear elliptic equations of the Monge-Ampère type. Comput. Methods Appl. Mech. Engrg.195 (2006) 1344–1386.  Zbl1119.65116
  9. E.J. Dean and R. Glowinski, On the numerical solution of the elliptic Monge-Ampère equation in dimension two: a least-squares approach, in Partial differential equations, Comput. Methods Appl. Sci.16, Springer, Dordrecht, The Netherlands (2008) 43–63.  Zbl1152.65479
  10. E.J. Dean, R. Glowinski and T.-W. Pan, Operator-splitting methods and applications to the direct numerical simulation of particulate flow and to the solution of the elliptic Monge-Ampère equation, in Control and boundary analysis, Lect. Notes Pure Appl. Math.240, Chapman & Hall/CRC, Boca Raton, USA (2005) 1–27.  Zbl1188.65115
  11. L.C. Evans, Partial differential equations and Monge-Kantorovich mass transfer, in Current developments in mathematics, 1997 (Cambridge, MA), Int. Press, Boston, USA (1999) 65–126.  
  12. X. Feng and M. Neilan, Galerkin methods for the fully nonlinear Monge-Ampère equation. (2007).  Zbl1229.65213URIhttp://arxiv.org/abs/0712.1240v1
  13. X. Feng and M. Neilan, Mixed finite element methods for the fully nonlinear Monge-Ampère equation based on the vanishing moment method. SIAM J. Numer. Anal.47 (2009) 1226–1250.  Zbl1195.65170
  14. X. Feng and M. Neilan, Vanishing moment method and moment solutions for fully nonlinear second order partial differential equations. J. Sci. Comput.38 (2009) 74–98.  Zbl1203.65252
  15. R. Glowinski, Numerical methods for fully nonlinear elliptic equations, in 6th International Congress on Industrial and Applied Mathematics, ICIAM 07, Invited Lectures, R. Jeltsch and G. Wanner Eds. (2009) 155–192.  Zbl1179.65146
  16. R. Glowinski, E.J. Dean, G. Guidoboni, L.H. Juárez and T.-W. Pan, Applications of operator-splitting methods to the direct numerical simulation of particulate and free-surface flows and to the numerical solution of the two-dimensional elliptic Monge-Ampère equation. Japan J. Indust. Appl. Math.25 (2008) 1–63.  Zbl1141.76043
  17. C.E. Gutiérrez, The Monge-Ampère equation, Progress in Nonlinear Differential Equations and their Applications44. Birkhäuser Boston Inc., Boston, USA (2001).  
  18. G. Loeper and F. Rapetti, Numerical solution of the Monge-Ampère equation by a Newton's algorithm. C. R. Math. Acad. Sci. Paris340 (2005) 319–324.  Zbl1067.65119
  19. A.M. Oberman, Convergent difference schemes for degenerate elliptic and parabolic equations: Hamilton-Jacobi equations and free boundary problems. SIAM J. Numer. Anal.44 (2006) 879–895.  Zbl1124.65103
  20. A.M. Oberman, Computing the convex envelope using a nonlinear partial differential equation. Math. Models Methods Appl. Sci.18 (2008) 759–780.  Zbl1154.35056
  21. A.M. Oberman, Wide stencil finite difference schemes for the elliptic Monge-Ampère equation and functions of the eigenvalues of the Hessian. Discrete Contin. Dyn. Syst. Ser. B10 (2008) 221–238.  Zbl1145.65085
  22. V.I. Oliker and L.D. Prussner, On the numerical solution of the equation (∂2z/∂x2)(∂2z/∂y2) - (∂2z/∂x∂y)2 = f and its discretizations, I. Numer. Math.54 (1988) 271–293.  Zbl0659.65116

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.