Abstract
We compare the generator coordinate method (GCM) and the random-phase approximation (RPA) in the framework of the exactly solvable Lipkin-Meshkov-Glick model. We show that the discretized GCM works quite well and permits to obtain results close to the exact results with a small number of discretization points.
- Received 28 March 2006
DOI:https://doi.org/10.1103/PhysRevC.74.024311
©2006 American Physical Society