SIMPLIFIED RECURSIVE ALGORITHM FOR WIGNER 3J AND 6J SYMBOLS

We present a highly accurate, ab initio recursive algorithm for evalua ting the Wigner 3j and 6j symbols. Our method makes use of two-term, n onlinear recurrence relations that an obtained from the standard three -term recurrence relations satisfied by these quantities. The use of t wo-term recurrence relations eliminates the need for rescaling of iter ates to control numerical overflows and thereby simplifies the widely used recursive algorithm of Schulten and Gordon.