An efficient projection algorithm and its application to the spurious center-of-mass motion problem
Abstract
Based on the correspondence of projection to an eigenvalue problem via the underlying group structure, we generalize the projection algorithm proposed by Morrison et al. This algorithm is eligible for large-scale computations, because we can avoid the accumulation of errors. As an example, we apply it to the spurious c.m. motion in a multi-ω shell-model calculation. In comparison with Lawson's method, the present method is exact and nevertheless does not need longer CPU time. It is pointed out that the exact treatment of the spurious c.m. motion is crucial to some physical quantities.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.