Recursive generation of cartesian angular momentum coupling trees for SO(3)

Published: 1 January 1990| Version 1 | DOI: 10.17632/ydjzksg8tw.1
Brad S. Sherborne, G.E. Stedman


Abstract Two computer algorithms are evaluated for the reduction of angular momentum coupling trees with vector (j = 1) terminals with a Cartesian choice of basis as used in nonlinear optics. Rather than employ advanced tensor algebra, both methods essentially iterate in distinct ways the basic techniques of angular momentum coupling. Turbo Pascal programs implementing these algorithms are presented and compared. The accompanying analysis integrates the Cartesian ten... Title of program: AMTREES Catalogue Id: ABRD_v1_0 Nature of problem When the geometry of a nonlinear optical experiment is altered, by changing the polarisation of one or more participating light beams or by space-time operations on the applied fields or the medium, the resulting change in the optical effect is restricted by symmetry considerations, and can be predicted from the knowlegde of a set of irreducible physical constants. As nonlinear optical processes of ever greater complexity become feasible and of interest, the construction of an efficient algorith ... Versions of this program held in the CPC repository in Mendeley Data ABRD_v1_0; AMTREES; 10.1016/0010-4655(90)90188-7 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)



Computational Physics, Computational Method