Sector decomposition via computational geometry
High Energy Physics - Phenomenology
2010-05-03 v1
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.
Keywords
Cite
@article{arxiv.1004.5490,
title = {Sector decomposition via computational geometry},
author = {Toshiaki Kaneko and Takahiro Ueda},
journal= {arXiv preprint arXiv:1004.5490},
year = {2010}
}
Comments
7 pages, 2 figures, Talk given at 13th International Workshop on Advanced Computing and Analysis Techniques in Physics Research,February 26, 2010, Jaipur, India