The dependency of spectral gaps on the convergence of the inverse iteration for a nonlinear eigenvector problem

From MaRDI portal
Publication:6133476

DOI10.1142/S0218202523500343zbMATH Open1517.65103arXiv2202.07593MaRDI QIDQ6133476FDOQ6133476

Patrick Henning

Publication date: 24 July 2023

Published in: M\(^3\)AS. Mathematical Models \& Methods in Applied Sciences (Search for Journal in Brave)

Abstract: In this paper we consider the generalized inverse iteration for computing ground states of the Gross-Pitaevskii eigenvector problem (GPE). For that we prove explicit linear convergence rates that depend on the maximum eigenvalue in magnitude of a weighted linear eigenvalue problem. Furthermore, we show that this eigenvalue can be bounded by the first spectral gap of a linearized Gross-Pitaevskii operator, recovering the same rates as for linear eigenvector problems. With this we establish the first local convergence result for the basic inverse iteration for the GPE without damping. We also show how our findings directly generalize to extended inverse iterations, such as the Gradient Flow Discrete Normalized (GFDN) proposed in [W. Bao, Q. Du, SIAM J. Sci. Comput., 25 (2004)] or the damped inverse iteration suggested in [P. Henning, D. Peterseim, SIAM J. Numer. Anal., 53 (2020)]. Our analysis also reveals why the inverse iteration for the GPE does not react favourably to spectral shifts. This empirical observation can now be explained with a blow-up of a weighting function that crucially contributes to the convergence rates. Our findings are illustrated by numerical experiments.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: The dependency of spectral gaps on the convergence of the inverse iteration for a nonlinear eigenvector problem

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