Robust and fast iterative method for the elliptic Monge-Ampère equation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909788058681344 |
|---|---|
| author | Köhle, R. N. Menting, K. T. W. Mitra, K. Boonkkamp, J. H. M. ten Thije |
| author_facet | Köhle, R. N. Menting, K. T. W. Mitra, K. Boonkkamp, J. H. M. ten Thije |
| contents | This paper introduces a fast and robust iterative scheme for the elliptic Monge-Ampère equation with Dirichlet boundary conditions. The Monge-Ampère 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 $H^2$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_00794 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Robust and fast iterative method for the elliptic Monge-Ampère equation Köhle, R. N. Menting, K. T. W. Mitra, K. Boonkkamp, J. H. M. ten Thije Numerical Analysis Analysis of PDEs 35J96, 65J15, 47J25, 65F08 This paper introduces a fast and robust iterative scheme for the elliptic Monge-Ampère equation with Dirichlet boundary conditions. The Monge-Ampère 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 $H^2$ 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. |
| title | Robust and fast iterative method for the elliptic Monge-Ampère equation |
| topic | Numerical Analysis Analysis of PDEs 35J96, 65J15, 47J25, 65F08 |
| url | https://arxiv.org/abs/2509.00794 |