Inverse Iteration for the Monge-Ampère Eigenvalue Problem (2001.01291v2)
Abstract: We present an iterative method based on repeatedly inverting the Monge-Amp`ere operator with Dirichlet boundary condition and prescribed right-hand side on a bounded, convex domain $\Omega \subset \mathbb{R}n$. We prove that the iterates $u_k$ generated by this method converge as $k \to \infty$ to a solution of the Monge-Amp`ere eigenvalue problem $$\begin{cases} \text{det} D2u = \lambda_{MA} (-u)n & \quad \text{in } \Omega,\ u = 0 & \quad \text{on } \partial \Omega. \end{cases}$$ Since the solutions of this problem are unique up to a positive multiplicative constant, the normalized iterates $\hat{u}k := \frac{u_k}{||u_k||{L{\infty}(\Omega)}}$ converge to the eigenfunction of unit height. In addition, we show that $\lim\limits_{k \to \infty} R(u_k) = \lim\limits_{k \to \infty} R(\hat{u}k) = \lambda{MA}$, where the Rayleigh quotient $R(u)$ is defined as $$R(u) := \frac{\int_{\Omega} (-u) \ \text{det} D2u}{\int_{\Omega} (-u){n+1}}.$$ Our method converges for a wide class of initial choices $u_0$ that can be constructed explicitly, and does not rely on prior knowledge of the Monge-Amp`ere eigenvalue $\lambda_{MA}$.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.