23 | | |
| 23 | In the attachment of this page, I have put an example of such a matrix.f, for gg>ggg, which I (Fabio) did by hand. |
| 24 | It's very simple: the idea is that instead of writing down all the jamp's explicitly, we have one function that |
| 25 | calculates one of them, given an order of the external gluons (let's say the identity order (1,2,3,...n) with n the number of gluons. In addition only the diagrams contributing to this jamp are calculated. |
| 26 | At the end this is slower that the current way madgraph does because one ends up in calculating many times the same |
| 27 | diagrams, i.e. this is inefficient. |
| 29 | === Second Step : getting the code faster. === |
| 30 | |
| 31 | I believe the recalculation of the sigrams could be avoided with some clever caching, even though |
| 32 | I am not sure how to do this in fortran. One alternative solution is to use recursive Berends-Giele relations. |
| 33 | This is easy enough for pure gluonic amplitudes, which could be used to make tests. |
| 34 | There is also another clear improvement that one could try to make, which is storing only one line of the color matrix |
| 35 | and getting all the others by applying the same permutations. Finally, if one is able to generate the permutations instead of listing them in the code, one could really write a small code. |
| 36 | |
| 37 | === Third Step : Expand the results in powers and MC over flows 1/Nc^2 === |
| 38 | |
| 39 | More about this to come... |
| 40 | |
| 41 | |
| 42 | |