TY -
T1 - Improved recursive computation of clebsch-Gordan coefficients
SN - /
UR - http://hdl.handle.net/10138/325695
T3 -
A1 - Xu, Guanglang
A2 -
PB -
Y1 - 2020
LA - eng
AB - Fast, accurate, and stable computation of the Clebsch-Gordan (C-G) coefficients is always desirable, for example, in light scattering simulations, the translation of the multipole fields, quantum physics and chemistry. Current recursive methods for computing the C-G coefficients are often unstable for large quantum numbers due to numerical overflow or underflow. In this paper, we present an improved method, called the sign-exponent recurrence, for the recursive computation of C-G coefficients. T...
VO -
IS -
SP -
OP -
KW - Clebsch-Gordan coefficients; Recursive computation; Light scattering; Translation coefficients; Multipole fields; T-Matrix; LIGHT-SCATTERING; MATRIX-ELEMENTS; T-MATRIX; TRANSLATION; 3J-COEFFICIENTS; 6J-COEFFICIENTS; 3J; 114 Physical sciences
N1 -
PP -
ER -