An efficient algorithm for the Riemannian 10j symbols

Details An efficient algorithm for the Riemannian 10j symbols An efficient algorithm for the Riemannian 10j symbols

2001-10-09

arxiv.org/abs/gr-qc/0110045v3

Class.Quant.Grav. 19 (2002) 1185-1194

Astronomy and Astrophysics

Astrophysics

General Relativity and Quantum Cosmology

9 pages, 5 postscript figures. This is the version that is to appear in Classical and Quantum Gravity. See also http://jdc.mat

Scientific paper

10.1088/0264-9381/19/6/310

The 10j symbol is a spin network that appears in the partition function for the Barrett-Crane model of Riemannian quantum gravity. Elementary methods of calculating the 10j symbol require order(j^9) or more operations and order(j^2) or more space, where j is the average spin. We present an algorithm that computes the 10j symbol using order(j^5) operations and order(j^2) space, and a variant that uses order(j^6) operations and a constant amount of space. An implementation has been made available on the web.

Affiliated with

Also associated with

No associations

Rating

An efficient algorithm for the Riemannian 10j symbols does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient algorithm for the Riemannian 10j symbols, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient algorithm for the Riemannian 10j symbols will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-396329