Fully discrete least-squares splitting scheme for the Monge-Ampère equation: finite element analysis and convergence
arXiv:2607.15024
The paper introduces a fully discrete finite element framework for the two‑dimensional Dirichlet Monge‑Ampère equation using a least‑squares splitting algorithm, and provides convergence proofs and optimal error estimates for several , interior‑penalty and discontinuous Galerkin discretizations.
Abstract
The least-squares splitting algorithm for the Monge-Ampère equation has been used successfully in computations for several years, but a convergence theory for fully discrete splitting schemes of this type has remained unavailable. In this work, we introduce and analyze a finite element framework for smooth solutions of the Dirichlet Monge-Ampère equation in two dimensions. The proposed schemes combine a discrete Hessian reconstruction with a local projection onto the determinant constraint. Under a discrete Miranda-Talenti estimate and standard approximation properties of the Hessian reconstruction, we prove local convergence of the iterative scheme and optimal-order convergence of its limit to the exact solution in an -type norm. We verify the estimates for conforming schemes, including the Argyris element, and for -interior penalty and DG schemes of degree at least three; quadratic -interior penalty and DG schemes are also covered when is sufficiently small. To the best of our knowledge, these discretizations have not previously been proposed or analyzed for least-squares splitting methods. Numerical experiments confirm the theoretical convergence rates.
25 pages