Paper detail

An inverse iteration method for eigenvalue problems with eigenvector nonlinearities

Consider a symmetric matrix $A(v)\in\RR^{n\times n}$ depending on a vector $v\in\RR^n$ and satisfying the property $A(αv)=A(v)$ for any $α\in\RR\backslash{0}$. We will here study the problem of finding $(λ,v)\in\RR\times \RR^n\backslash\{0\}$ such that $(λ,v)$ is an eigenpair of the matrix $A(v)$ and we propose a generalization of inverse iteration for eigenvalue problems with this type of eigenvector nonlinearity. The convergence of the proposed method is studied and several convergence properties are shown to be analogous to inverse iteration for standard eigenvalue problems, including local convergence properties. The algorithm is also shown to be equivalent to a particular discretization of an associated ordinary differential equation, if the shift is chosen in a particular way. The algorithm is adapted to a variant of the Schrödinger equation known as the Gross-Pitaevskii equation. We use numerical simulations toillustrate the convergence properties, as well as the efficiency of the algorithm and the adaption.