Timeline for Appropriate Recursion relations for Wigner 3j Symbols
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 17, 2015 at 4:48 | comment | added | Zurab Silagadze | You can download the second paper from here wwwsnd.inp.nsk.su/~silagadz/3j.pdf In this paper mnras.oxfordjournals.org/content/360/4/1262.full (Cosmic microwave background temperature and polarization pseudo-Cℓ estimators and covariances) they mention the Fortran program DRC3JJ.f and provide a link to download it. The program "uses the algorithm of Schulten & Gordon (1975) which makes use of both forward and backward recurrence relations to maintain numerical stability. It is both rapid and accurate, even for large multipole values". Hope this helps. | |
| Sep 16, 2015 at 15:19 | comment | added | Cosmi | Hi there I can't seem to access the second paper you have suggested. While google searching I found this: brockport.edu/cps/publications/CPC1998.pdf which claims to state the Schulten & Gordon methods. I an confused since I need to calculate a lot of Wigner symbols, as my maximum l is 10,000. I am confused how to use recursion to ensure I calculate all of them. Would you be able to show an example of how one goes about using a recursion relation methodically? The problem with such a high maximum l is that for example python cannot cope with calculating all the l-combinations. | |
| Sep 15, 2015 at 3:24 | history | edited | Zurab Silagadze | CC BY-SA 3.0 |
Typo corrected, titles of the articles added
|
| Sep 14, 2015 at 19:36 | history | answered | Zurab Silagadze | CC BY-SA 3.0 |