Apr 30, 2010
Sector decomposition via computational geometry
- ,
A non-iterative method is presented for the factorization step of sector
decomposition method, which separates infrared divergent part from loop
integration. This method is based on a classification of asymptotic behavior of
polynomials. The problem is converted to ones for convex body in Euclidean
space. They are solved with algorithms developed in computational geometry. A
test implementation shows that this method produces less number of decomposed
sectors than usual iterative sector decompositions.
decomposition method, which separates infrared divergent part from loop
integration. This method is based on a classification of asymptotic behavior of
polynomials. The problem is converted to ones for convex body in Euclidean
space. They are solved with algorithms developed in computational geometry. A
test implementation shows that this method produces less number of decomposed
sectors than usual iterative sector decompositions.
- Link information
-
- arXiv
- http://arxiv.org/abs/arXiv:1004.5490
- Arxiv Url
- http://arxiv.org/abs/1004.5490v1
- Arxiv Url
- http://arxiv.org/pdf/1004.5490v1 Open access
- ID information
-
- arXiv ID : arXiv:1004.5490