On standard finite difference discretizations of the elliptic Monge-Ampère equation

From MaRDI portal
Publication:2014041

DOI10.1007/S10915-016-0220-YzbMATH Open1368.65211arXiv1311.2812OpenAlexW1953450255MaRDI QIDQ2014041FDOQ2014041

Gerard Awanou

Publication date: 10 August 2017

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Abstract: Given an orthogonal lattice with mesh length h on a bounded convex domain, we propose to approximate the Aleksandrov solution of the Monge-Ampere equation by regularizing the data and discretizing the equation in a subdomain using the standard finite difference method. The Dirichlet data is used to approximate the solution in the remaining part of the domain. We prove the uniform convergence on compact subsets of the solution of the discrete problems to an approximate problem on the subdomain. The result explains the behavior of methods based on the standard finite difference method and designed to numerically converge to non-smooth solutions. We propose an algorithm which for smooth solutions appears faster than the popular Newton's method with a high accuracy for non smooth solutions. The convergence of the algorithm is independent of how close to the numerical solution the initial guess is, upon rescaling the equation and given a user's measure of the closeness of an initial guess.


Full work available at URL: https://arxiv.org/abs/1311.2812




Recommendations




Cites Work


Cited In (9)





This page was built for publication: On standard finite difference discretizations of the elliptic Monge-Ampère equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014041)