Subtraction method and stability condition in the extended RPA theories
V. I. Tselyaev

TL;DR
This paper examines the stability of extended RPA theories, demonstrating that the subtraction method ensures stability and generalizes the Thouless theorem, with illustrations from a schematic model.
Contribution
It introduces the use of the subtraction method to ensure stability in extended RPA theories and generalizes the Thouless theorem for these models.
Findings
Stability in extended RPA theories is achieved using the subtraction method.
The subtraction method generalizes the Thouless theorem.
Illustrative example provided with a schematic model.
Abstract
The extended RPA theories are analyzed from the point of view of the problem of stability of their solutions. Three kinds of such theories are considered: the second RPA and two versions of the quasiparticle-phonon coupling model within the time-blocking approximation: the model including 1p1h*phonon configurations and the two-phonon model. It is shown that stability is ensured by making use of the subtraction method proposed previously to solve double counting problem in these theories. This enables one to generalize the famous Thouless theorem proved in the case of the RPA. These results are illustrated by an example of schematic model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
