Numerical Solution of Altarelli-Parisi Equations
Abstract
We discuss numerical solution of Altarelli-Parisi equations in a Laguerre-polynomial method and in a brute-force method. In the Laguerre method, we get good accuracy by taking about twenty Laguerre polynomials in the flavor-nonsinglet case. Excellent evolution results are obtained in the singlet case by taking only ten Laguerre polynomials. The accuracy becomes slightly worse in the small and large regions, especially in the nonsinglet case. These problems could be implemented by using the brute-force method; however, running CPU time could be significantly longer than the one in the Laguerre method.
Cite
@article{arxiv.hep-ph/9412341,
title = {Numerical Solution of Altarelli-Parisi Equations},
author = {R. Kobayashi and M. Konuma and S. Kumano and M. Miyama},
journal= {arXiv preprint arXiv:hep-ph/9412341},
year = {2010}
}
Comments
8 pages, Latex, Figs.1-6 are not included, talk given at a YITP workshop, Kyoto, Japan, Oct.30 - Nov.1, 1994, Complete ps file available at ftp://ftp.cc.saga-u.ac.jp/pub/paper/riko/quantum1/saga-he-74.ps.gz or at http://www.cc.saga-u.ac.jp/saga-u/riko/physics/quantum1/structure.html