Last update: Sat Oct 14 02:39:56 MDT 2017
@Article{Stein:1967:CPA,
author = "Josef Stein",
title = "Computational problems associated with {Racah}
algebra",
journal = j-J-COMPUT-PHYS,
volume = "1",
number = "3",
pages = "397--405",
month = feb,
year = "1967",
CODEN = "JCTPAH",
DOI = "https://doi.org/10.1016/0021-9991(67)90047-2",
ISSN = "0021-9991 (print), 1090-2716 (electronic)",
ISSN-L = "0021-9991",
bibdate = "Sun Jan 1 08:27:59 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jcomputphys1960.bib;
http://www.math.utah.edu/pub/tex/bib/prng.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0021999167900472",
abstract = "In a program written by the author, for performing
various calculations in the Racah algebra, some new
calculational methods were used; these methods are
described in this paper. They include: (1) a
representation of numbers alternative to the Rotenberg
form; (2) a new algorithm for calculating the greatest
common divisor of two odd integers, which was developed
for reducing the calculating time in the new
representation; (3) methods for shortening the
computation time of 3-j and 6-j symbols.",
acknowledgement = ack-nhfb,
affiliation = "The Hebrew University, Jerusalem, Israel",
fjournal = "Journal of Computational Physics",
journal-URL = "http://www.sciencedirect.com/science/journal/00219991/",
keywords = "fast greatest common denominator (gcd)",
remark = "This may be the earliest published paper about
speeding up computation of the greatest common
denominator (gcd). Brent \cite{Brent:1999:TYA} also
cites earlier unpublished work of Silver and Terzian
(1962), and quotes a translation of a first century AD
Chinese text given by Knuth \cite[\S
4.5.2]{Knuth:1997:SA} that describes what we now call
the ``binary Euclidean algorithm''.",
}