Data structure techniques for the graphical special unitary group approach to arbitrary spin representations

Published: 1 January 1987| Version 1 | DOI: 10.17632/2wy6gsp4c2.1
R.D. Kent, M. Schlesinger


Abstract Title of programs: GENDRT, DRTDIM Catalogue number: AATF Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland (see application form in this issue) Computer: IBM PC, PC/XT, PC/AT; Installation: University of Windsor Operating system: MS-DOS (PC-DOS) version 2.1 or higher Programming language used: Pascal High speed storage required: GENDRT - 128 Kwords minimum, DRTDIM - 128 Kwords minimum Number of bits in a word: 16 Peripherals used: video terminal, floppy o... Title of program: GENDRT, DRTDIM Catalogue Id: AATF_v1_0 Nature of problem For the purpose of computing matrix elements of quantum mechanical operators in complex N-particle systems it is necessary that as much of each irreducible representation be stored in high-speed memory as possible inorder to achieve the highest possible rate of computations. A graph theoretic approach to the representation of N-particle systems involving arbitrary single-particle spin is presented. The method involves a generalization of a technique employed by Shavitt in developing the graphica ... Versions of this program held in the CPC repository in Mendeley Data AATF_v1_0; GENDRT, DRTDIM; 10.1016/0010-4655(87)90058-0 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)



Computational Physics, Computational Method