2000 character limit reached
Optimized recursion relation for the computation of partition functions in the superconfiguration approach
Published 28 Sep 2020 in cond-mat.stat-mech and physics.atom-ph | (2009.13518v1)
Abstract: Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion relation for the calculation of such partition functions. In this paper, we propose an optimization of the latter method and explain how to implement it in practice. The formalism relies on the evaluation of elementary symmetric polynomials, which opens the way to further improvements.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.