On the Reduction of the Generalized RPA Eigenvalue Problem

Abstract
The 2n-dimensional eigenvalue problem, which arises when the random phase approximation (RPA) matrix is not real, is reduced to an n-dimensional eigenvalue problem. Some properties of the reduced eigenvalue problem are studied. A numerical example is considered for illustrative purposes.