Simplified recursive algorithm for Wigner 3j and 6j symbols
Luscombe, James H.
MetadataShow full item record
We present a highly accurate, ab initio recursive algorithm for evaluating the Wigner 3 j and 6 j symbols. Our method makes use of two-term, nonlinear recurrence relations that are obtained from the standard three-term recurrence relations satisfied by these quantities. The use of two-term recurrence relations eliminates the need for rescaling of iterates to control numerical overflows and thereby simplifies the widely used recursive algorithm of Schulten and Gordon.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Zyda, Michael J. (Monterey, California. Naval Postgraduate School, 1984-09); NPS-52-84-013We present in this study the architectural specification and feasibility determination for a real-time contour display generator. We begin by examining a recently reported, highly decomposable algorithm for contour surface ...