The parallel computation of Racah coefficients using transputers
β Scribed by N.S. Scott; P. Milligan; H.W.C. Riley
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 963 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
β¦ Synopsis
Title of program. PRACAH in CPC. This program is different in that it is a parallel solution programmed in OCCAM and executed on a network Catalogue number: AAXE of TRANSPUTERS. Program obtainable from: CPC Program Library, Queen's Urn-Restrictions on the complexity of the problem versity of Belfast, N. Ireland (see application form in this For simplicity, the program driver designed for the test-run issue) requires the Racah coefficient arguments to have values less than or equal to 4.5. Computer used: IMS B002 TRANSPUTER Evaluation Board, IMS B003 TRANSPUTER Evaluation Board and VAX 8650 Typical running time Timing details are given in section 3.3. The complete test-run Installation: The Queen's University of Belfast, Department of timed on the B002 Board took 2879376 cycles (2.88 s) for 600 Computer Science Racah coefficients. Operating system: IMS D600 TRANSPUTER Development Unusual features of the program System The FOLDING EDITOR used by the TRANSPUTER Development System makes use of special control codes. Because of Programming language used. OCCAM the need to distribute the program as card images the program is published in the form of a printable listing. The user can High speed storage required: Evaluation boards have a mini-easily insert appropriate folds using the FOLDING EDITOR. mum of 1 Mbyte. This is more than adequate It should be noted that the three processes, master, sum and delta need to be treated as semi-compiled folds. The two No. of bits in a word: 32 processes FLOAT32 and B002.terminal.driver which are provided in the IMS D600 TRANSPUTER Development System No. of lines in source program: 435 are not published because of copyright reasons. These should be inserted into the program at the points indicated by
π SIMILAR VOLUMES
Using binomial coefficients the Clebsch-Gordan and Gaunt coefficients were calculated for extremely large quantum numbers. The main advantage of this approach is directly calculating these coefficients, instead of using recursion relations. Accuracy of the results is quite high for quantum numbers \