A Convergent Inexact Abedin-Kitagawa Iteration Method for Monge-Ampère Eigenvalue Problems
Liang Chen, Youyicun Lin, Junqi Yang, Wenfan Yi
TL;DR
The paper tackles computing Monge-Ampère eigenpairs by adapting the Abedin–Kitagawa iteration to an inexact setting with a summable error sequence in subproblem solves, preserving convergence to the MAE eigenpair. It introduces fixed-point reformulations in 2D and 3D to efficiently solve the MA subproblems, and provides rigorous convergence analysis for both general and nonnegative-error cases under $\mathcal{C}^{2,\alpha}$ boundary conditions. Theoretical results show that the Rayleigh quotient updates converge to $\lambda_{\rm MA}$ and the iterates converge to the corresponding eigenfunction $u_{\infty}$, with subsequences coinciding and the full sequence converging. Numerical experiments in 2D and 3D demonstrate that the inexact fixed-point AKI method achieves substantial speedups (often by factors of 5–40) while maintaining or improving accuracy relative to existing approaches, validating the method's efficiency and robustness for MAE problems.
Abstract
This paper proposes an inexact Aleksandrov-solution-based iteration method, formulated by adapting the convergent Rayleigh inverse iterative scheme introduced by Abedin and Kitagawa, to solve real Monge-Amp{è}re eigenvalue (MAE) problems. The central feature of the proposed approach is the introduction of a flexible error tolerance criterion for computing inexact Aleksandrov solutions to the required subproblems. This allows the inner iteration to be solved approximately without compromising the global convergence properties of the overall scheme, as we established under a ${\cal C}^{2,α}$ boundary condition, and has the potential of achieving reduced computational cost compared to the original algorithm. In practice, for both two- and three-dimensional problems, by leveraging the flexibility of the inexact iterative formulation in conjunction with a fixed-point approach for solving the subproblems, the proposed method performs several times faster than its original version of Abedin and Kitagawa, across all tested problem instances in the numerical experiments.
