Papers
Topics
Authors
Recent
2000 character limit reached

Robust and fast iterative method for the elliptic Monge-Ampère equation

Published 31 Aug 2025 in math.NA, cs.NA, and math.AP | (2509.00794v1)

Abstract: This paper introduces a fast and robust iterative scheme for the elliptic Monge-Amp`ere equation with Dirichlet boundary conditions. The Monge-Amp`ere equation is a nonlinear and degenerate equation, with applications in optimal transport, geometric optics, and differential geometry. The proposed method linearises the equation and uses a fixed-point iteration (L-scheme), solving a Poisson problem in each step with a weighted residual as the right-hand side. This algorithm is robust against discretisation, nonlinearities, and degeneracies. For a weight greater than the largest eigenvalue of the Hessian, contraction in $H2$ and $L\infty$ is proven for both classical and generalised solutions, respectively. The method's performance can be enhanced by using preconditioners or Green's functions. Test cases demonstrate that the scheme outperforms Newton's method in speed and stability.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.