User-friendly routines for tree storage and retrieval of multidimensional arrays

Published: 01-01-1984| Version 1 | DOI: 10.17632/mms6mp7yyn.1
Contributor:
P.B. Visscher

Description

Title of program: TESTSUB Catalogue Id: ACMT_v1_0 Nature of problem Many physical problems require the use of large multidimensional arrays such as Z(I1,...IL), in which the indices IJ are small integers: quantumnumbers of orbitals in atomic physics, lattice-point separation vectors in solid-state physics, etc. If the arrays are very far from rectangular, tree storage is by far the most efficient (and often the only practical) storage technique. However, most physicists are not familiar with tree-storage algorithms, and are therefore forced to do the problem ver ... Versions of this program held in the CPC repository in Mendeley Data ACMT_v1_0; TESTSUB; 10.1016/0010-4655(84)90017-1 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)

Files