A computer code for calculations in the algebraic collective model of the atomic nucleus

Abstract

A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model’s SU(1,1)×SO(5) dynamical group. This paper reviews the mathematical formulation of the ACM, and serves as a manual for the code.The code enables a wide range of model Hamiltonians to be analysed. This range includes essentially all Hamiltonians that are rational functions of the model’s quadrupole moments qˆM and are at most quadratic in the corresponding conjugate momenta πˆN (−2≤M,N≤2). The code makes use of expressions for matrix elements derived elsewhere and newly derived matrix elements of the operators [πˆ⊗qˆ⊗πˆ]0 and [πˆ⊗πˆ]LM. The code is made efficient by use of an analytical expression for the needed SO(5)-reduced matrix elements, and use of SO(5)⊃SO(3) Clebsch–Gordan coefficients obtained from precomputed data files provided with the code. Program summaryProgram title: ACMCatalogue identifier: AEYO_v1_0Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEYO_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 3873526No. of bytes in distributed program, including test data, etc.: 46345414Distribution format: tar.gzProgramming language: Maple 18 (or versions 17, 16, 15).Computer: Any.Operating system: Any which supports Maple; tested under Linux, Max OSX, Windows 7.RAM: 500MbClassification: 17.20.Nature of problem: The calculation of energy eigenvalues, transition rates and amplitudes of user specified Hamiltonians in the Bohr model of the atomic nucleus.Solution method: Exploit the model’s SU(1,1)×SO(5) dynamical group to calculate analytic (as far as possible) expressions for matrix elements, making use of extensive files (supplied) of SO(5)⊃SO(3) Clebsch–Gordan coefficients. Diagonalisation of the resulting matrices (once the entries are converted to floating point) is carried out using the Maple library procedure Eigenvectors. (Maple [1] makes use of the NAG [2] and CLAPACK [3] linear algebra libraries.)Additional comments: 1.The dimension of the Hilbert space that can be handled is limited only by the available computer memory and the available SO(5)⊃SO(3) Clebsch–Gordan coefficients (v1α1L1v2α2L2∥v3α3L3).2.The supplied data files provide coefficients (v1α1L1v2α2L2∥v3α3L3) for 1≤v2≤6, and contain all non-zero coefficients for v1<v3≤50 when v2∈1,3, for v1≤v3≤30 when v2∈2,4, and for v1≤v3≤25 when v2∈5,6. (Once calculated, further coefficients can be readily made available to the code without changing the code.) Thus, depending on the model Hamiltonian being analysed, the states in the Hilbert space used are limited in their seniority. For analysis of the more typical types of model Hamiltonian, only the coefficients with v2∈{1,3} are required, and therefore, with the supplied files, the seniority limit is 50. More exotic Hamiltonians having terms with seniority v2∈{2,4,5,6} would have the seniority limited to 30 or 25 accordingly.3.The code provides lower level procedures that give ready access to the Clebsch–Gordan coefficients and the SU(1, 1) and SO(5) matrix elements. These procedures are described in the manuscript and enable extensions to the code and model to be made easily.4.The accuracy to which Maple performs numerical calculations is determined by the Maple parameter Digits, which specifies the number of significant decimal digits used. The default value of 10 is more than adequate for most ACM calculations. Note, however, that if Digits is increased beyond a certain value (obtained from the Maple command evalhf(Digits), and usually 15 on modern computers) then the code can no longer take advantage of hardware mathematical operations, and is significantly slower.Documents included1.The code makes use of SO(5)⊃SO(3) Clebsch–Gordan coefficients which are supplied in zip files, and must be installed by the user.2.A Maple worksheet that gives various example calculations and tests carried out using procedures from the code is provided.3.A 162 page PDF file containing everything displayed in the worksheet (input, output and comments, and making use of colour) is also provided. !!!!! The distribution file for this program is over 46 Mbytes and therefore is not delivered directly when download or Email is requested. Instead a html file giving details of how the program can be obtained is sent. !!!!!Running time: For a fixed value of the parameter Digits, the running time depends on the dimension of the Hilbert space on which the diagonalisation is performed, and this in turn is governed by the number of eigenvalues required and the accuracy required. Note that diagonalisation is performed separately in each L-space. For typical ACM calculations (such as those carried out in [4]), the matrices being diagonalised are usually of dimension at most a few hundred, and often much smaller. On a modest personal computer, the computation for the smallest cases takes at most a few seconds. The worksheet contains a range of examples for which the calculation time varies between a few seconds and 750s. In the latter case, diagonalisation is performed on L-spaces for 0≤L≤8, the dimensions of these spaces being between 154 and 616.