Nazakat Ullah, K. K. Gupta
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.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Eigenvalues and eigenvectors, Divide-and-conquer eigenvalue algorithm, Mathematics, Reduction (mathematics), Eigenvalue perturbation, Random phase approximation, Applied mathematics, Matrix (chemical analysis)