Trees | Indices | Help |
---|
|
object --+ | dict --+ | base_objects.PhysicsObject --+ | MultiProcess
MultiProcess: list of process definitions list of processes (after cleaning) list of amplitudes (after generation)
|
|||
Inherited from |
|
|||
|
|||
new empty dictionary |
|
||
|
|||
D[k] if k in D, else d |
|
||
|
|||
Inherited from Inherited from Inherited from |
|
|||
|
|||
|
|||
|
|
|||
Inherited from |
|
|||
Inherited from |
|
Default values for all properties
|
Allow initialization with ProcessDefinition or ProcessDefinitionList
|
Filter for valid process property values.
|
Get the value of the property name.
|
Return process property names as a nicely sorted list.
|
Generate amplitudes in a semi-efficient way. Make use of crossing symmetry for processes that fail diagram generation, but not for processes that succeed diagram generation. Doing so will risk making it impossible to identify processes with identical amplitudes. |
Find the minimal WEIGHTED order for this set of processes. The algorithm: 1) Check the coupling hierarchy of the model. Assign all particles to the different coupling hierarchies so that a particle is considered to be in the highest hierarchy (i.e., with lowest value) where it has an interaction. 2) Pick out the legs in the multiprocess according to the highest hierarchy represented (so don't mix particles from different hierarchy classes in the same multiparticles!) 3) Find the starting maximum WEIGHTED order as the sum of the highest n-2 weighted orders 4) Pick out required s-channel particle hierarchies, and use the highest of the maximum WEIGHTED order from the legs and the minimum WEIGHTED order extracted from 2*s-channel hierarchys plus the n-2-2*(number of s-channels) lowest leg weighted orders. 5) Run process generation with the WEIGHTED order determined in 3)-4) - # final state gluons, with all gluons removed from the final state 6) If no process is found, increase WEIGHTED order by 1 and go back to 5), until we find a process which passes. Return that order. 7) Continue 5)-6) until we reach (n-2)*(highest hierarchy)-1. If still no process has passed, return WEIGHTED = (n-2)*(highest hierarchy) |
Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Tue Jul 24 08:02:10 2012 | http://epydoc.sourceforge.net |