Computer codes are developed to calculate Clebsch–Gordan coefficients of SU(3) in both SU(2)and SO(3)-coupled bases. The efficiency of this code derives from the use of vector coherent state theory to evaluate the required coefficients directly without recursion relations. The approach extends to other compact semi-simple Lie groups. The codes are given in subroutine form so that users can inco...

We here study electronic structure and magnetic properties of disordered bcc CoxFe1−x, CrxFe1−x and MnxFe1−x alloys in their ferromagnetic phases using Augmented Space Recursion (ASR) technique coupled with tight-binding linearized muffin tin orbital (TB-LMTO) method. We calculate the densities of states, magnetic moments and Curie temperatures of these alloys to show the variation upon alloyin...

By analytically continuing QCD scattering amplitudes through specific complexified momenta, one can study and learn about the nature and the consequences of factorization and unitarity. In some cases, when coupled with the largest time equation and gauge invariance requirement, this approach leads to recursion relations, which greatly simplify the construction of multi-gluon scattering amplitud...

The magnetization of Ni1−xMox single crystals with x=4,6,8 and 10 % by weight have been measured at 4.2K using a vibrating sample magnetometer and a Superconducting Quantum Interference Device (SQID). The magnetization of the alloy at these low concentrations and at 0K have been theoretically determined by using the tight-binding lnearized muffin-tin orbital method coupled with augmented space ...

The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...

Abstract Recursion is a mature, well-understood topic in the theory and practice of programming. Yet its dual, corecursion underappreciated still seen as exotic. We aim to put them both on equal footing by giving foundation for primitive based computation, terminating calculus analogous original computational recursion. show how implementation details an abstract machine strengthens their conne...