The matrix elements of spin-dependent U (2n) generators are given explicitly. These matrix elements are expressed in terms of those of spin-independent U(n) and U (n + 1) generators, and can therefore be easily incorporated into existing unitary group approach based programs.
Formulae for the spin-dependent unitary group approach
โ Scribed by James S. Battle; Mark D. Gould
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 588 KB
- Volume
- 201
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
โฆ Synopsis
This Letter is concerned with formalism for performing spin-dependent CI calculations on molecules, We communicate the mathematical formulae for the matrix elements of the U (2n) generators in the spin-orbit U(n) xU( ) symmetry adapted basis, as required for spin-dependent (CI) calculations. Our formulae arc given in terms of the Paldus tableau approach as well as Shavitt's graphical approach and hence minimal effort will be needed to incorporate this work into existing graphical unitary group approach computer codes. A detailed derivation of our results will be presented elsewhere. The U( 2n) matrix element formulae given here can be used to find the matrix representative of any spin-dependent operator in the U(n) X U (2) basis.
๐ SIMILAR VOLUMES
Matrix element formulas for spin-dependent operators in a basis of spin-adapted ลฝ . antisymmetrized products of orthonormal orbitals configuration-state functions are presented. The coefficients of one-and two-electron integrals depend only on the form of the spin-dependence of the operator and on t
Transformation matrices for the representations of the spin permutation group may be easily derived using graphical methods of angular momentum theory. The transformation from the genealogical spin basis to the Jahn-Serber basis is considered as an illustrative example. The spin functions for an N-
The conjugacy classes of the finite general linear and unitary groups are used to define probability measures on the set of all partitions of all natural numbers. Probabilistic algorithms for growing random partitions according to these measures are obtained. These algorithms are applied to prove gr