Algorithms for Computing U(N) Clebsch Gordan Coefficients

ISSN： 0167-8019

Source： Acta Applicandae Mathematicae, Vol.95, Iss.1, 2007-01, pp. : 51-72

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Clebsch‐Gordan coefficients for scattering processes in Si and Ge

PHYSICA STATUS SOLIDI (C) - CURRENT TOPICS IN SOLID STATE PHYSICS, Vol. 9, Iss. 10‐11, 2012-10 ,pp. : 1978-1980

John Wiley & Sons Inc

Access to resources Recommend Favorite

The Clebsch–Gordan Coefficients with Respect to Various Bases for Unitary and Orthogonal Representations of SU(2) and SO(3)

By Godunov S. K. Gordienko V. M.

Siberian Mathematical Journal, Vol. 45, Iss. 3, 2004-05 ,pp. : 443-458

Springer Publishing Company

Access to resources Recommend Favorite

Generalized Bibasic Hypergeometric Series and Their U(n) Extensions

By Bhatnagar G. Milne S.C.

Advances in Mathematics, Vol. 131, Iss. 1, 1997-10 ,pp. : 188-252

Academic Press

Access to resources Recommend Favorite

Connection coefficients, orthogonal polynomials and the WZ-algorithms

By Wimp Jet

Numerical Algorithms, Vol. 21, Iss. 1-4, 1999-09 ,pp. : 377-386

Springer Publishing Company

Access to resources Recommend Favorite

ALGORITHMS FOR COMPUTING APPROXIMATE REPETITIONS IN MUSICAL SEQUENCES

By CAMBOUROPOULOS EMILIOS

International Journal of Computer Mathematics, Vol. 79, Iss. 11, 2002-01 ,pp. : 1135-1148

Taylor & Francis Ltd

Access to resources Recommend Favorite