## Abstract

In this article, we address the numerical solution of the Dirichlet problem for the three-dimensional elliptic Monge–Ampère equation using a least-squares/relaxation approach. The relaxation algorithm allows the decoupling of the differential operators from the nonlinearities. Dedicated numerical solvers are derived for the efficient solution of the local optimization problems with cubicly nonlinear equality constraints. The approximation relies on mixed low order finite element methods with regularization techniques. The results of numerical experiments show the convergence of our relaxation method to a convex classical solution if such a solution exists; otherwise they show convergence to a generalized solution in a least-squares sense. These results show also the robustness of our methodology and its ability at handling curved boundaries and non-convex domains.

Original language | English |
---|---|

Pages (from-to) | 53-78 |

Number of pages | 26 |

Journal | Journal of Scientific Computing |

Volume | 77 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1 Oct 2018 |

## Scopus Subject Areas

- Software
- Theoretical Computer Science
- Numerical Analysis
- Engineering(all)
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics

## User-Defined Keywords

- Least-squares method
- Mixed finite element method
- Monge–Ampère equation
- Newton methods
- Nonlinear constrained minimization