Sector decomposition via computational geometry
arXiv:1004.5490
Abstract
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.
7 pages, 2 figures, Talk given at 13th International Workshop on Advanced Computing and Analysis Techniques in Physics Research,February 26, 2010, Jaipur, India
References in corpus (7)
- An automatized algorithm to compute infrared divergent multi-loop integrals
- Numerical evaluation of multi-loop integrals by sector decomposition
- Resolution of singularities for multi-loop integrals
- Numerical evaluation of phase space integrals by sector decomposition
- FIESTA 2: parallelizeable multiloop numerical calculations
- A geometric method of sector decomposition
- New implementation of the sector decomposition on FORM