論文

査読有り
2010年8月

A geometric method of sector decomposition

Computer Physics Communications
  • Toshiaki Kaneko
  • ,
  • Takahiro Ueda

181
8
開始ページ
1352
終了ページ
1361
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.1016/j.cpc.2010.04.001

We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method provides a deterministic algorithm and never falls into an infinite loop. The number of resulting sectors depends on the algorithm of triangulation. Our test implementation shows smaller number of sectors comparing with other existing methods with iterations. © 2010 Elsevier B.V. All rights reserved.

リンク情報
DOI
https://doi.org/10.1016/j.cpc.2010.04.001
arXiv
http://arxiv.org/abs/arXiv:0908.2897
Arxiv Url
http://arxiv.org/abs/0908.2897v1
Arxiv Url
http://arxiv.org/pdf/0908.2897v1 本文へのリンクあり
ID情報
  • DOI : 10.1016/j.cpc.2010.04.001
  • ISSN : 0010-4655
  • arXiv ID : arXiv:0908.2897
  • SCOPUS ID : 77953129039

エクスポート
BibTeX RIS